/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:02:58,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:02:58,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:02:58,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:02:58,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:02:58,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:02:58,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:02:58,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:02:58,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:02:58,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:02:58,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:02:58,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:02:58,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:02:58,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:02:58,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:02:58,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:02:58,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:02:58,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:02:58,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:02:58,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:02:58,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:02:58,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:02:58,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:02:58,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:02:58,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:02:58,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:02:58,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:02:58,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:02:58,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:02:58,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:02:58,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:02:58,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:02:58,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:02:58,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:02:58,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:02:58,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:02:58,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:02:58,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:02:58,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:02:58,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:02:58,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:02:58,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:02:58,859 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:02:58,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:02:58,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:02:58,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:02:58,860 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:02:58,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:02:58,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:02:58,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:02:58,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:02:58,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:02:58,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:02:58,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:02:58,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:02:58,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:02:58,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:02:58,863 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:02:58,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:02:58,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:02:58,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:02:58,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:02:58,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:02:58,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:02:58,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:02:58,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:02:58,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:02:58,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:02:58,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:02:58,865 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:02:58,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:02:58,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:02:59,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:02:59,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:02:59,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:02:59,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:02:59,174 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:02:59,175 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-18 23:02:59,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fd7e586/12704279fbc842eda0afa52a1d12260e/FLAG275d204b2 [2019-12-18 23:02:59,809 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:02:59,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-18 23:02:59,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fd7e586/12704279fbc842eda0afa52a1d12260e/FLAG275d204b2 [2019-12-18 23:03:00,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fd7e586/12704279fbc842eda0afa52a1d12260e [2019-12-18 23:03:00,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:03:00,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:03:00,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:00,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:03:00,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:03:00,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:00,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00, skipping insertion in model container [2019-12-18 23:03:00,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:00,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:03:00,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:03:00,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:00,712 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:03:00,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:00,907 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:03:00,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00 WrapperNode [2019-12-18 23:03:00,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:00,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:00,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:03:00,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:03:00,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:00,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:00,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:00,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:03:00,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:03:00,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:03:00,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:00,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:00,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:01,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:01,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:01,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:01,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... [2019-12-18 23:03:01,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:03:01,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:03:01,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:03:01,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:03:01,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:03:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:03:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:03:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:03:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:03:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:03:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:03:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:03:01,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:03:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:03:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:03:01,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:03:01,101 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:03:01,826 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:03:01,827 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:03:01,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:01 BoogieIcfgContainer [2019-12-18 23:03:01,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:03:01,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:03:01,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:03:01,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:03:01,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:03:00" (1/3) ... [2019-12-18 23:03:01,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed2155f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:01, skipping insertion in model container [2019-12-18 23:03:01,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:00" (2/3) ... [2019-12-18 23:03:01,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed2155f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:01, skipping insertion in model container [2019-12-18 23:03:01,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:01" (3/3) ... [2019-12-18 23:03:01,837 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2019-12-18 23:03:01,849 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:03:01,849 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:03:01,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:03:01,859 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:03:01,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,896 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,897 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,897 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,905 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,905 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,918 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,922 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:01,941 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:03:01,963 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:03:01,963 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:03:01,963 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:03:01,963 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:03:01,964 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:03:01,964 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:03:01,964 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:03:01,984 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:03:02,011 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 23:03:02,013 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 23:03:02,130 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 23:03:02,130 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:02,148 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 23:03:02,166 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 23:03:02,244 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 23:03:02,244 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:02,253 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 23:03:02,273 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 23:03:02,274 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:03:05,223 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 23:03:05,342 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 23:03:05,362 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48987 [2019-12-18 23:03:05,362 INFO L214 etLargeBlockEncoding]: Total number of compositions: 94 [2019-12-18 23:03:05,366 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-18 23:03:05,879 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9272 states. [2019-12-18 23:03:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 9272 states. [2019-12-18 23:03:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:03:05,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:05,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:03:05,890 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:05,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:05,896 INFO L82 PathProgramCache]: Analyzing trace with hash 713212, now seen corresponding path program 1 times [2019-12-18 23:03:05,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:05,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486234064] [2019-12-18 23:03:05,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:06,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486234064] [2019-12-18 23:03:06,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:06,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:03:06,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173880561] [2019-12-18 23:03:06,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:06,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:06,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:06,129 INFO L87 Difference]: Start difference. First operand 9272 states. Second operand 3 states. [2019-12-18 23:03:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:06,468 INFO L93 Difference]: Finished difference Result 9157 states and 30129 transitions. [2019-12-18 23:03:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:06,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:03:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:06,571 INFO L225 Difference]: With dead ends: 9157 [2019-12-18 23:03:06,571 INFO L226 Difference]: Without dead ends: 8975 [2019-12-18 23:03:06,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8975 states. [2019-12-18 23:03:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8975 to 8975. [2019-12-18 23:03:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8975 states. [2019-12-18 23:03:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8975 states to 8975 states and 29569 transitions. [2019-12-18 23:03:07,130 INFO L78 Accepts]: Start accepts. Automaton has 8975 states and 29569 transitions. Word has length 3 [2019-12-18 23:03:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:07,130 INFO L462 AbstractCegarLoop]: Abstraction has 8975 states and 29569 transitions. [2019-12-18 23:03:07,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 8975 states and 29569 transitions. [2019-12-18 23:03:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:03:07,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:07,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:07,136 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:07,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1430597214, now seen corresponding path program 1 times [2019-12-18 23:03:07,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:07,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754750826] [2019-12-18 23:03:07,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:07,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754750826] [2019-12-18 23:03:07,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:07,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:07,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75935694] [2019-12-18 23:03:07,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:07,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:07,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:07,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:07,319 INFO L87 Difference]: Start difference. First operand 8975 states and 29569 transitions. Second operand 4 states. [2019-12-18 23:03:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:07,713 INFO L93 Difference]: Finished difference Result 13878 states and 43543 transitions. [2019-12-18 23:03:07,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:07,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 23:03:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:07,789 INFO L225 Difference]: With dead ends: 13878 [2019-12-18 23:03:07,790 INFO L226 Difference]: Without dead ends: 13871 [2019-12-18 23:03:07,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13871 states. [2019-12-18 23:03:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 12673. [2019-12-18 23:03:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-18 23:03:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 40347 transitions. [2019-12-18 23:03:08,323 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 40347 transitions. Word has length 11 [2019-12-18 23:03:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:08,323 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 40347 transitions. [2019-12-18 23:03:08,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 40347 transitions. [2019-12-18 23:03:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:03:08,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:08,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:08,333 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash 244087264, now seen corresponding path program 1 times [2019-12-18 23:03:08,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:08,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975099559] [2019-12-18 23:03:08,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:08,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975099559] [2019-12-18 23:03:08,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:08,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:08,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130452905] [2019-12-18 23:03:08,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:08,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:08,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:08,416 INFO L87 Difference]: Start difference. First operand 12673 states and 40347 transitions. Second operand 4 states. [2019-12-18 23:03:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:08,672 INFO L93 Difference]: Finished difference Result 15173 states and 47858 transitions. [2019-12-18 23:03:08,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:08,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 23:03:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:08,723 INFO L225 Difference]: With dead ends: 15173 [2019-12-18 23:03:08,724 INFO L226 Difference]: Without dead ends: 15173 [2019-12-18 23:03:08,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15173 states. [2019-12-18 23:03:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15173 to 13657. [2019-12-18 23:03:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-18 23:03:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 43454 transitions. [2019-12-18 23:03:09,874 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 43454 transitions. Word has length 11 [2019-12-18 23:03:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:09,874 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 43454 transitions. [2019-12-18 23:03:09,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 43454 transitions. [2019-12-18 23:03:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:03:09,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:09,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:09,879 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:09,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1210915997, now seen corresponding path program 1 times [2019-12-18 23:03:09,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:09,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102486907] [2019-12-18 23:03:09,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:09,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102486907] [2019-12-18 23:03:09,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:09,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:09,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078183063] [2019-12-18 23:03:09,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:09,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:09,956 INFO L87 Difference]: Start difference. First operand 13657 states and 43454 transitions. Second operand 5 states. [2019-12-18 23:03:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:10,569 INFO L93 Difference]: Finished difference Result 18000 states and 55976 transitions. [2019-12-18 23:03:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:03:10,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:03:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:10,607 INFO L225 Difference]: With dead ends: 18000 [2019-12-18 23:03:10,607 INFO L226 Difference]: Without dead ends: 17993 [2019-12-18 23:03:10,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:03:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17993 states. [2019-12-18 23:03:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17993 to 13513. [2019-12-18 23:03:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13513 states. [2019-12-18 23:03:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13513 states to 13513 states and 42886 transitions. [2019-12-18 23:03:11,034 INFO L78 Accepts]: Start accepts. Automaton has 13513 states and 42886 transitions. Word has length 17 [2019-12-18 23:03:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:11,035 INFO L462 AbstractCegarLoop]: Abstraction has 13513 states and 42886 transitions. [2019-12-18 23:03:11,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 13513 states and 42886 transitions. [2019-12-18 23:03:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:03:11,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:11,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:11,050 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash 368877695, now seen corresponding path program 1 times [2019-12-18 23:03:11,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:11,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945081151] [2019-12-18 23:03:11,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:11,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945081151] [2019-12-18 23:03:11,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:11,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:11,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557850661] [2019-12-18 23:03:11,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:11,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:11,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:11,122 INFO L87 Difference]: Start difference. First operand 13513 states and 42886 transitions. Second operand 3 states. [2019-12-18 23:03:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:11,365 INFO L93 Difference]: Finished difference Result 16497 states and 51650 transitions. [2019-12-18 23:03:11,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:11,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 23:03:11,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:11,389 INFO L225 Difference]: With dead ends: 16497 [2019-12-18 23:03:11,389 INFO L226 Difference]: Without dead ends: 16497 [2019-12-18 23:03:11,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16497 states. [2019-12-18 23:03:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16497 to 14538. [2019-12-18 23:03:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14538 states. [2019-12-18 23:03:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14538 states to 14538 states and 46033 transitions. [2019-12-18 23:03:11,830 INFO L78 Accepts]: Start accepts. Automaton has 14538 states and 46033 transitions. Word has length 25 [2019-12-18 23:03:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:11,832 INFO L462 AbstractCegarLoop]: Abstraction has 14538 states and 46033 transitions. [2019-12-18 23:03:11,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:11,832 INFO L276 IsEmpty]: Start isEmpty. Operand 14538 states and 46033 transitions. [2019-12-18 23:03:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:03:11,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:11,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:11,850 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash 276108521, now seen corresponding path program 1 times [2019-12-18 23:03:11,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:11,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674774653] [2019-12-18 23:03:11,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:11,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674774653] [2019-12-18 23:03:11,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:11,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:03:11,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537455596] [2019-12-18 23:03:11,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:03:11,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:11,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:03:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:11,946 INFO L87 Difference]: Start difference. First operand 14538 states and 46033 transitions. Second operand 6 states. [2019-12-18 23:03:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:12,706 INFO L93 Difference]: Finished difference Result 20241 states and 62761 transitions. [2019-12-18 23:03:12,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:03:12,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 23:03:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:12,743 INFO L225 Difference]: With dead ends: 20241 [2019-12-18 23:03:12,743 INFO L226 Difference]: Without dead ends: 20225 [2019-12-18 23:03:12,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:03:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states. [2019-12-18 23:03:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 16589. [2019-12-18 23:03:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16589 states. [2019-12-18 23:03:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16589 states to 16589 states and 52200 transitions. [2019-12-18 23:03:13,162 INFO L78 Accepts]: Start accepts. Automaton has 16589 states and 52200 transitions. Word has length 25 [2019-12-18 23:03:13,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:13,163 INFO L462 AbstractCegarLoop]: Abstraction has 16589 states and 52200 transitions. [2019-12-18 23:03:13,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:03:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 16589 states and 52200 transitions. [2019-12-18 23:03:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 23:03:13,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:13,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:13,188 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1785185324, now seen corresponding path program 1 times [2019-12-18 23:03:13,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:13,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295238336] [2019-12-18 23:03:13,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:13,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295238336] [2019-12-18 23:03:13,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:13,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:13,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334441181] [2019-12-18 23:03:13,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:13,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:13,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:13,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:13,270 INFO L87 Difference]: Start difference. First operand 16589 states and 52200 transitions. Second operand 4 states. [2019-12-18 23:03:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:13,302 INFO L93 Difference]: Finished difference Result 2316 states and 5300 transitions. [2019-12-18 23:03:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:03:13,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-18 23:03:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:13,306 INFO L225 Difference]: With dead ends: 2316 [2019-12-18 23:03:13,306 INFO L226 Difference]: Without dead ends: 2039 [2019-12-18 23:03:13,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-12-18 23:03:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2019-12-18 23:03:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-12-18 23:03:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 4534 transitions. [2019-12-18 23:03:13,906 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 4534 transitions. Word has length 31 [2019-12-18 23:03:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:13,906 INFO L462 AbstractCegarLoop]: Abstraction has 2039 states and 4534 transitions. [2019-12-18 23:03:13,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 4534 transitions. [2019-12-18 23:03:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 23:03:13,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:13,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:13,910 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1705539938, now seen corresponding path program 1 times [2019-12-18 23:03:13,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:13,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026242664] [2019-12-18 23:03:13,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:14,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026242664] [2019-12-18 23:03:14,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:14,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:03:14,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910757674] [2019-12-18 23:03:14,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:03:14,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:14,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:03:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:03:14,090 INFO L87 Difference]: Start difference. First operand 2039 states and 4534 transitions. Second operand 8 states. [2019-12-18 23:03:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:14,920 INFO L93 Difference]: Finished difference Result 2608 states and 5669 transitions. [2019-12-18 23:03:14,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:03:14,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-18 23:03:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:14,926 INFO L225 Difference]: With dead ends: 2608 [2019-12-18 23:03:14,926 INFO L226 Difference]: Without dead ends: 2606 [2019-12-18 23:03:14,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:03:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2019-12-18 23:03:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2100. [2019-12-18 23:03:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-18 23:03:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4675 transitions. [2019-12-18 23:03:14,965 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4675 transitions. Word has length 37 [2019-12-18 23:03:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:14,966 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 4675 transitions. [2019-12-18 23:03:14,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:03:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4675 transitions. [2019-12-18 23:03:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:03:14,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:14,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:14,972 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:14,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:14,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1992807550, now seen corresponding path program 1 times [2019-12-18 23:03:14,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:14,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987917413] [2019-12-18 23:03:14,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:15,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987917413] [2019-12-18 23:03:15,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:15,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:03:15,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088058536] [2019-12-18 23:03:15,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:15,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:15,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:15,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:15,058 INFO L87 Difference]: Start difference. First operand 2100 states and 4675 transitions. Second operand 5 states. [2019-12-18 23:03:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:15,556 INFO L93 Difference]: Finished difference Result 2859 states and 6230 transitions. [2019-12-18 23:03:15,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:03:15,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 23:03:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:15,560 INFO L225 Difference]: With dead ends: 2859 [2019-12-18 23:03:15,561 INFO L226 Difference]: Without dead ends: 2859 [2019-12-18 23:03:15,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-12-18 23:03:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2524. [2019-12-18 23:03:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-12-18 23:03:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 5561 transitions. [2019-12-18 23:03:15,600 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 5561 transitions. Word has length 41 [2019-12-18 23:03:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:15,601 INFO L462 AbstractCegarLoop]: Abstraction has 2524 states and 5561 transitions. [2019-12-18 23:03:15,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 5561 transitions. [2019-12-18 23:03:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 23:03:15,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:15,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:15,606 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash 621749952, now seen corresponding path program 1 times [2019-12-18 23:03:15,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:15,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958461746] [2019-12-18 23:03:15,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:15,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958461746] [2019-12-18 23:03:15,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:15,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:03:15,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311961961] [2019-12-18 23:03:15,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:15,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:15,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:15,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:15,735 INFO L87 Difference]: Start difference. First operand 2524 states and 5561 transitions. Second operand 5 states. [2019-12-18 23:03:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:16,272 INFO L93 Difference]: Finished difference Result 3398 states and 7362 transitions. [2019-12-18 23:03:16,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:03:16,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 23:03:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:16,277 INFO L225 Difference]: With dead ends: 3398 [2019-12-18 23:03:16,277 INFO L226 Difference]: Without dead ends: 3398 [2019-12-18 23:03:16,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:03:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-12-18 23:03:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 2821. [2019-12-18 23:03:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-12-18 23:03:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 6202 transitions. [2019-12-18 23:03:16,322 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 6202 transitions. Word has length 42 [2019-12-18 23:03:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:16,322 INFO L462 AbstractCegarLoop]: Abstraction has 2821 states and 6202 transitions. [2019-12-18 23:03:16,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 6202 transitions. [2019-12-18 23:03:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 23:03:16,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:16,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:16,328 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:16,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:16,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1119205876, now seen corresponding path program 1 times [2019-12-18 23:03:16,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:16,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995226502] [2019-12-18 23:03:16,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:16,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995226502] [2019-12-18 23:03:16,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:16,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:03:16,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875012660] [2019-12-18 23:03:16,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:16,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:16,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:16,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:16,410 INFO L87 Difference]: Start difference. First operand 2821 states and 6202 transitions. Second operand 5 states. [2019-12-18 23:03:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:16,450 INFO L93 Difference]: Finished difference Result 709 states and 1307 transitions. [2019-12-18 23:03:16,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:16,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 23:03:16,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:16,451 INFO L225 Difference]: With dead ends: 709 [2019-12-18 23:03:16,452 INFO L226 Difference]: Without dead ends: 629 [2019-12-18 23:03:16,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:03:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-18 23:03:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 503. [2019-12-18 23:03:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-12-18 23:03:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 918 transitions. [2019-12-18 23:03:16,460 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 918 transitions. Word has length 42 [2019-12-18 23:03:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:16,460 INFO L462 AbstractCegarLoop]: Abstraction has 503 states and 918 transitions. [2019-12-18 23:03:16,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 918 transitions. [2019-12-18 23:03:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 23:03:16,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:16,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:16,462 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash 703118835, now seen corresponding path program 1 times [2019-12-18 23:03:16,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:16,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090209002] [2019-12-18 23:03:16,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:16,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090209002] [2019-12-18 23:03:16,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:16,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:16,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503164938] [2019-12-18 23:03:16,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:16,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:16,584 INFO L87 Difference]: Start difference. First operand 503 states and 918 transitions. Second operand 3 states. [2019-12-18 23:03:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:16,634 INFO L93 Difference]: Finished difference Result 502 states and 916 transitions. [2019-12-18 23:03:16,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:16,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 23:03:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:16,635 INFO L225 Difference]: With dead ends: 502 [2019-12-18 23:03:16,635 INFO L226 Difference]: Without dead ends: 502 [2019-12-18 23:03:16,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-18 23:03:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 388. [2019-12-18 23:03:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-18 23:03:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 707 transitions. [2019-12-18 23:03:16,640 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 707 transitions. Word has length 52 [2019-12-18 23:03:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:16,640 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 707 transitions. [2019-12-18 23:03:16,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 707 transitions. [2019-12-18 23:03:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 23:03:16,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:16,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:16,642 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash 167419695, now seen corresponding path program 1 times [2019-12-18 23:03:16,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:16,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190498231] [2019-12-18 23:03:16,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:16,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190498231] [2019-12-18 23:03:16,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:16,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:03:16,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475122686] [2019-12-18 23:03:16,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:16,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:16,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:16,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:16,746 INFO L87 Difference]: Start difference. First operand 388 states and 707 transitions. Second operand 5 states. [2019-12-18 23:03:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:16,787 INFO L93 Difference]: Finished difference Result 595 states and 1091 transitions. [2019-12-18 23:03:16,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:16,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 23:03:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:16,789 INFO L225 Difference]: With dead ends: 595 [2019-12-18 23:03:16,789 INFO L226 Difference]: Without dead ends: 276 [2019-12-18 23:03:16,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:03:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-18 23:03:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-12-18 23:03:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-18 23:03:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 514 transitions. [2019-12-18 23:03:16,793 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 514 transitions. Word has length 53 [2019-12-18 23:03:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:16,794 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 514 transitions. [2019-12-18 23:03:16,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 514 transitions. [2019-12-18 23:03:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 23:03:16,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:16,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:16,795 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:16,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash -936120261, now seen corresponding path program 2 times [2019-12-18 23:03:16,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:16,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736709767] [2019-12-18 23:03:16,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:16,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736709767] [2019-12-18 23:03:16,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:16,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:16,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943901705] [2019-12-18 23:03:16,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:16,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:16,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:16,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:16,856 INFO L87 Difference]: Start difference. First operand 276 states and 514 transitions. Second operand 3 states. [2019-12-18 23:03:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:16,867 INFO L93 Difference]: Finished difference Result 256 states and 459 transitions. [2019-12-18 23:03:16,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:16,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 23:03:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:16,868 INFO L225 Difference]: With dead ends: 256 [2019-12-18 23:03:16,868 INFO L226 Difference]: Without dead ends: 256 [2019-12-18 23:03:16,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-18 23:03:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 220. [2019-12-18 23:03:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-18 23:03:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 391 transitions. [2019-12-18 23:03:16,872 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 391 transitions. Word has length 53 [2019-12-18 23:03:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:16,872 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 391 transitions. [2019-12-18 23:03:16,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 391 transitions. [2019-12-18 23:03:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:16,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:16,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:16,874 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash 10303747, now seen corresponding path program 1 times [2019-12-18 23:03:16,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:16,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007109970] [2019-12-18 23:03:16,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:17,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007109970] [2019-12-18 23:03:17,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:17,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 23:03:17,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065877897] [2019-12-18 23:03:17,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:03:17,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:17,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:03:17,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:03:17,074 INFO L87 Difference]: Start difference. First operand 220 states and 391 transitions. Second operand 12 states. [2019-12-18 23:03:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:17,498 INFO L93 Difference]: Finished difference Result 386 states and 665 transitions. [2019-12-18 23:03:17,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:03:17,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 23:03:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:17,499 INFO L225 Difference]: With dead ends: 386 [2019-12-18 23:03:17,500 INFO L226 Difference]: Without dead ends: 354 [2019-12-18 23:03:17,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:03:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-18 23:03:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 320. [2019-12-18 23:03:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 23:03:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 562 transitions. [2019-12-18 23:03:17,505 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 562 transitions. Word has length 54 [2019-12-18 23:03:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:17,506 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 562 transitions. [2019-12-18 23:03:17,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:03:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 562 transitions. [2019-12-18 23:03:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:17,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:17,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:17,507 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:17,508 INFO L82 PathProgramCache]: Analyzing trace with hash 691777001, now seen corresponding path program 2 times [2019-12-18 23:03:17,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:17,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771019479] [2019-12-18 23:03:17,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:17,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771019479] [2019-12-18 23:03:17,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:17,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:03:17,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889445801] [2019-12-18 23:03:17,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:03:17,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:03:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:03:17,771 INFO L87 Difference]: Start difference. First operand 320 states and 562 transitions. Second operand 13 states. [2019-12-18 23:03:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:18,141 INFO L93 Difference]: Finished difference Result 422 states and 716 transitions. [2019-12-18 23:03:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:03:18,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 23:03:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:18,143 INFO L225 Difference]: With dead ends: 422 [2019-12-18 23:03:18,143 INFO L226 Difference]: Without dead ends: 390 [2019-12-18 23:03:18,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:03:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-18 23:03:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 328. [2019-12-18 23:03:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 23:03:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 576 transitions. [2019-12-18 23:03:18,148 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 576 transitions. Word has length 54 [2019-12-18 23:03:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:18,148 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 576 transitions. [2019-12-18 23:03:18,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:03:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 576 transitions. [2019-12-18 23:03:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:18,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:18,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:18,150 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1943788027, now seen corresponding path program 3 times [2019-12-18 23:03:18,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:18,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613296232] [2019-12-18 23:03:18,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:03:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:03:18,320 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:03:18,320 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:03:18,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2473~0.base_19|) (= v_~x~0_11 0) (= v_~y$r_buff0_thd1~0_24 0) (= 0 v_~y$r_buff1_thd0~0_45) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_108 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19|) 0) (= v_~y$mem_tmp~0_11 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t2473~0.base_19| 1)) (= 0 v_~y$w_buff0~0_29) (= v_~y~0_28 0) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2473~0.base_19|) |v_ULTIMATE.start_main_~#t2473~0.offset_16| 0))) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2473~0.base_19| 4)) (= v_~y$w_buff1_used~0_62 0) (= 0 v_~y$r_buff1_thd2~0_17) (= v_~y$r_buff0_thd0~0_81 0) (= 0 v_~weak$$choice0~0_6) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~y$r_buff1_thd1~0_17) (= 0 v_~weak$$choice2~0_31) (= 0 |v_ULTIMATE.start_main_~#t2473~0.offset_16|) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, ULTIMATE.start_main_~#t2473~0.base=|v_ULTIMATE.start_main_~#t2473~0.base_19|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_15|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_~#t2473~0.offset=|v_ULTIMATE.start_main_~#t2473~0.offset_16|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_13|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_28, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_62} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2473~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2474~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2473~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:03:18,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L777-1-->L779: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2474~0.base_11|) |v_ULTIMATE.start_main_~#t2474~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t2474~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2474~0.base_11|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2474~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2474~0.base_11| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2474~0.base=|v_ULTIMATE.start_main_~#t2474~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2474~0.offset=|v_ULTIMATE.start_main_~#t2474~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2474~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2474~0.offset] because there is no mapped edge [2019-12-18 23:03:18,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 2 v_~y$w_buff0~0_21) (= v_~y$w_buff1_used~0_52 v_~y$w_buff0_used~0_89) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff0~0_22 v_~y$w_buff1~0_18) (= 0 (mod v_~y$w_buff1_used~0_52 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= 1 v_~y$w_buff0_used~0_88)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_21, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_52} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:03:18,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1546009506 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1546009506 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1546009506| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1546009506| ~y$w_buff0_used~0_In1546009506) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1546009506, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1546009506} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1546009506|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1546009506, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1546009506} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 23:03:18,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-606675791 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-606675791 256) 0))) (or (and (= ~y~0_In-606675791 |P1Thread1of1ForFork1_#t~ite9_Out-606675791|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-606675791 |P1Thread1of1ForFork1_#t~ite9_Out-606675791|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-606675791, ~y$w_buff1~0=~y$w_buff1~0_In-606675791, ~y~0=~y~0_In-606675791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-606675791} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-606675791, ~y$w_buff1~0=~y$w_buff1~0_In-606675791, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-606675791|, ~y~0=~y~0_In-606675791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-606675791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 23:03:18,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 23:03:18,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1874358682 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1874358682 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1874358682|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1874358682 |P1Thread1of1ForFork1_#t~ite11_Out1874358682|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1874358682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1874358682} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1874358682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1874358682, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1874358682|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 23:03:18,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-1133804536 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1133804536 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1133804536 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1133804536 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1133804536| ~y$w_buff1_used~0_In-1133804536) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1133804536|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1133804536, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1133804536, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1133804536, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1133804536} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1133804536|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1133804536, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1133804536, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1133804536, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1133804536} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 23:03:18,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1007662875 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1007662875 256)))) (or (and (= ~y$r_buff0_thd1~0_Out1007662875 ~y$r_buff0_thd1~0_In1007662875) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd1~0_Out1007662875 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1007662875, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1007662875} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1007662875, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1007662875|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1007662875} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 23:03:18,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-260803146 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-260803146 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-260803146 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-260803146 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-260803146|)) (and (= ~y$w_buff1_used~0_In-260803146 |P1Thread1of1ForFork1_#t~ite12_Out-260803146|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-260803146, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-260803146, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-260803146, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-260803146} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-260803146, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-260803146, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-260803146, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-260803146|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-260803146} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 23:03:18,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2083156022 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2083156022 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-2083156022| ~y$r_buff0_thd2~0_In-2083156022) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-2083156022| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2083156022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2083156022} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2083156022, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2083156022, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2083156022|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 23:03:18,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-824368981 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-824368981 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-824368981 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-824368981 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-824368981| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out-824368981| ~y$r_buff1_thd2~0_In-824368981) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-824368981, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-824368981, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-824368981, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-824368981} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-824368981, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-824368981, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-824368981, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-824368981|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-824368981} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 23:03:18,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 23:03:18,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1577864900 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1577864900 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In1577864900 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1577864900 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1577864900|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In1577864900 |P0Thread1of1ForFork0_#t~ite8_Out1577864900|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1577864900, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1577864900, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1577864900, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1577864900} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1577864900, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1577864900, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1577864900|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1577864900, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1577864900} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 23:03:18,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L738-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 23:03:18,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= (mod v_~y$w_buff0_used~0_75 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 23:03:18,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1915437390 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1915437390 256)))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1915437390| ~y$w_buff1~0_In1915437390) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In1915437390 |ULTIMATE.start_main_#t~ite17_Out1915437390|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1915437390, ~y~0=~y~0_In1915437390, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1915437390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915437390} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1915437390|, ~y$w_buff1~0=~y$w_buff1~0_In1915437390, ~y~0=~y~0_In1915437390, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1915437390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915437390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 23:03:18,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 23:03:18,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1094163413 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1094163413 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1094163413| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1094163413 |ULTIMATE.start_main_#t~ite19_Out1094163413|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1094163413, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1094163413} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1094163413, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1094163413|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1094163413} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 23:03:18,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In2075402778 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2075402778 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2075402778 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2075402778 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out2075402778| ~y$w_buff1_used~0_In2075402778)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite20_Out2075402778| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2075402778, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2075402778, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2075402778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2075402778} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2075402778, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2075402778, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2075402778|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2075402778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2075402778} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 23:03:18,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-689537114 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-689537114 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-689537114|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-689537114| ~y$r_buff0_thd0~0_In-689537114)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-689537114, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-689537114} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-689537114, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-689537114, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-689537114|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 23:03:18,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-829551561 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-829551561 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-829551561 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-829551561 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-829551561| ~y$r_buff1_thd0~0_In-829551561) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-829551561|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-829551561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-829551561, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-829551561, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829551561} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-829551561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-829551561, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-829551561, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-829551561|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829551561} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 23:03:18,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L799-->L799-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1498635531 256)))) (or (and (= ~y$w_buff0_used~0_In1498635531 |ULTIMATE.start_main_#t~ite34_Out1498635531|) (= |ULTIMATE.start_main_#t~ite34_Out1498635531| |ULTIMATE.start_main_#t~ite35_Out1498635531|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1498635531 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1498635531 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1498635531 256))) (and (= (mod ~y$r_buff1_thd0~0_In1498635531 256) 0) .cse0))) .cse1) (and (= ~y$w_buff0_used~0_In1498635531 |ULTIMATE.start_main_#t~ite35_Out1498635531|) (= |ULTIMATE.start_main_#t~ite34_In1498635531| |ULTIMATE.start_main_#t~ite34_Out1498635531|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1498635531, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1498635531, ~weak$$choice2~0=~weak$$choice2~0_In1498635531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1498635531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1498635531, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In1498635531|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1498635531, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1498635531, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1498635531|, ~weak$$choice2~0=~weak$$choice2~0_In1498635531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1498635531, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1498635531|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1498635531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 23:03:18,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 23:03:18,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_24 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:03:18,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 23:03:18,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:03:18 BasicIcfg [2019-12-18 23:03:18,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:03:18,460 INFO L168 Benchmark]: Toolchain (without parser) took 18366.70 ms. Allocated memory was 139.5 MB in the beginning and 793.2 MB in the end (delta: 653.8 MB). Free memory was 102.3 MB in the beginning and 375.8 MB in the end (delta: -273.4 MB). Peak memory consumption was 380.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:18,461 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 23:03:18,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.07 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.9 MB in the beginning and 157.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:18,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.73 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:18,463 INFO L168 Benchmark]: Boogie Preprocessor took 41.75 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:18,463 INFO L168 Benchmark]: RCFGBuilder took 806.25 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 107.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:18,464 INFO L168 Benchmark]: TraceAbstraction took 16628.37 ms. Allocated memory was 204.5 MB in the beginning and 793.2 MB in the end (delta: 588.8 MB). Free memory was 107.4 MB in the beginning and 375.8 MB in the end (delta: -268.4 MB). Peak memory consumption was 320.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:18,474 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.07 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.9 MB in the beginning and 157.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.73 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.75 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.25 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 107.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16628.37 ms. Allocated memory was 204.5 MB in the beginning and 793.2 MB in the end (delta: 588.8 MB). Free memory was 107.4 MB in the beginning and 375.8 MB in the end (delta: -268.4 MB). Peak memory consumption was 320.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 145 ProgramPointsBefore, 80 ProgramPointsAfterwards, 179 TransitionsBefore, 93 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 24 ChoiceCompositions, 3351 VarBasedMoverChecksPositive, 154 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48987 CheckedPairsTotal, 94 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2192 SDtfs, 1862 SDslu, 4902 SDs, 0 SdLazy, 3072 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16589occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 14579 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 99983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...