/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:02:11,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:02:11,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:02:11,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:02:11,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:02:11,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:02:11,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:02:11,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:02:11,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:02:11,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:02:11,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:02:11,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:02:11,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:02:11,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:02:11,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:02:11,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:02:11,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:02:11,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:02:11,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:02:11,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:02:11,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:02:11,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:02:11,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:02:11,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:02:11,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:02:11,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:02:11,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:02:11,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:02:11,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:02:11,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:02:11,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:02:11,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:02:11,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:02:11,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:02:11,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:02:11,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:02:11,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:02:11,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:02:11,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:02:11,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:02:11,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:02:11,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:02:11,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:02:11,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:02:11,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:02:11,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:02:11,634 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:02:11,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:02:11,634 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:02:11,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:02:11,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:02:11,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:02:11,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:02:11,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:02:11,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:02:11,637 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:02:11,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:02:11,637 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:02:11,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:02:11,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:02:11,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:02:11,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:02:11,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:02:11,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:02:11,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:02:11,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:02:11,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:02:11,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:02:11,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:02:11,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:02:11,640 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:02:11,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:02:11,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:02:11,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:02:11,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:02:11,931 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:02:11,931 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:02:11,932 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-18 12:02:12,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f22309c7/74489a59ad824fd38deb250ab3a96e8c/FLAGba51d0909 [2019-12-18 12:02:12,544 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:02:12,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-18 12:02:12,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f22309c7/74489a59ad824fd38deb250ab3a96e8c/FLAGba51d0909 [2019-12-18 12:02:12,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f22309c7/74489a59ad824fd38deb250ab3a96e8c [2019-12-18 12:02:12,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:02:12,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:02:12,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:02:12,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:02:12,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:02:12,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:02:12" (1/1) ... [2019-12-18 12:02:12,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:12, skipping insertion in model container [2019-12-18 12:02:12,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:02:12" (1/1) ... [2019-12-18 12:02:12,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:02:12,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:02:13,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:02:13,556 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:02:13,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:02:13,695 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:02:13,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13 WrapperNode [2019-12-18 12:02:13,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:02:13,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:02:13,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:02:13,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:02:13,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (1/1) ... [2019-12-18 12:02:13,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (1/1) ... [2019-12-18 12:02:13,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:02:13,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:02:13,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:02:13,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:02:13,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (1/1) ... [2019-12-18 12:02:13,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (1/1) ... [2019-12-18 12:02:13,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (1/1) ... [2019-12-18 12:02:13,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (1/1) ... [2019-12-18 12:02:13,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (1/1) ... [2019-12-18 12:02:13,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (1/1) ... [2019-12-18 12:02:13,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (1/1) ... [2019-12-18 12:02:13,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:02:13,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:02:13,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:02:13,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:02:13,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (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 12:02:13,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:02:13,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:02:13,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:02:13,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:02:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:02:13,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:02:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:02:13,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:02:13,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:02:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:02:13,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:02:13,916 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 12:02:14,897 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:02:14,898 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:02:14,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:02:14 BoogieIcfgContainer [2019-12-18 12:02:14,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:02:14,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:02:14,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:02:14,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:02:14,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:02:12" (1/3) ... [2019-12-18 12:02:14,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501cbda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:02:14, skipping insertion in model container [2019-12-18 12:02:14,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:02:13" (2/3) ... [2019-12-18 12:02:14,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501cbda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:02:14, skipping insertion in model container [2019-12-18 12:02:14,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:02:14" (3/3) ... [2019-12-18 12:02:14,910 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_rmo.oepc.i [2019-12-18 12:02:14,918 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:02:14,918 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:02:14,926 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:02:14,927 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:02:14,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:14,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,017 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,046 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,054 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:02:15,074 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 12:02:15,094 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:02:15,095 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:02:15,095 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:02:15,095 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:02:15,095 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:02:15,095 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:02:15,095 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:02:15,096 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:02:15,114 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-18 12:02:15,117 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-18 12:02:15,223 INFO L126 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-18 12:02:15,223 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:02:15,249 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 12:02:15,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-18 12:02:15,349 INFO L126 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-18 12:02:15,350 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:02:15,361 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 12:02:15,394 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-18 12:02:15,395 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:02:21,285 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 12:02:21,439 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 12:02:21,492 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-18 12:02:21,492 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 12:02:21,496 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-18 12:02:23,279 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-18 12:02:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-18 12:02:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:02:23,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:23,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:02:23,289 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:23,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-18 12:02:23,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:23,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675729874] [2019-12-18 12:02:23,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:23,521 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 12:02:23,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675729874] [2019-12-18 12:02:23,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:23,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:02:23,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206768927] [2019-12-18 12:02:23,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:02:23,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:23,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:02:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:02:23,541 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-18 12:02:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:24,114 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-18 12:02:24,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:02:24,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:02:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:24,358 INFO L225 Difference]: With dead ends: 29506 [2019-12-18 12:02:24,358 INFO L226 Difference]: Without dead ends: 27490 [2019-12-18 12:02:24,359 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 12:02:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-18 12:02:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-18 12:02:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-18 12:02:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-18 12:02:26,749 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-18 12:02:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:26,749 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-18 12:02:26,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:02:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-18 12:02:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:02:26,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:26,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:26,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:26,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:26,757 INFO L82 PathProgramCache]: Analyzing trace with hash -271665278, now seen corresponding path program 1 times [2019-12-18 12:02:26,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:26,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697913072] [2019-12-18 12:02:26,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:26,812 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 12:02:26,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697913072] [2019-12-18 12:02:26,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:26,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:02:26,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542181362] [2019-12-18 12:02:26,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:02:26,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:02:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:02:26,816 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 3 states. [2019-12-18 12:02:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:26,901 INFO L93 Difference]: Finished difference Result 3269 states and 8037 transitions. [2019-12-18 12:02:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:02:26,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 12:02:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:26,922 INFO L225 Difference]: With dead ends: 3269 [2019-12-18 12:02:26,922 INFO L226 Difference]: Without dead ends: 3269 [2019-12-18 12:02:26,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 12:02:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-12-18 12:02:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3269. [2019-12-18 12:02:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-18 12:02:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8037 transitions. [2019-12-18 12:02:27,043 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8037 transitions. Word has length 11 [2019-12-18 12:02:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:27,044 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8037 transitions. [2019-12-18 12:02:27,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:02:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8037 transitions. [2019-12-18 12:02:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:02:27,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:27,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:27,051 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-18 12:02:27,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:27,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291076400] [2019-12-18 12:02:27,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:27,185 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 12:02:27,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291076400] [2019-12-18 12:02:27,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:27,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:02:27,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40805584] [2019-12-18 12:02:27,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:02:27,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:27,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:02:27,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:02:27,189 INFO L87 Difference]: Start difference. First operand 3269 states and 8037 transitions. Second operand 4 states. [2019-12-18 12:02:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:27,507 INFO L93 Difference]: Finished difference Result 4313 states and 10392 transitions. [2019-12-18 12:02:27,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:02:27,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:02:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:27,521 INFO L225 Difference]: With dead ends: 4313 [2019-12-18 12:02:27,521 INFO L226 Difference]: Without dead ends: 4313 [2019-12-18 12:02:27,522 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 12:02:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-18 12:02:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4245. [2019-12-18 12:02:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-18 12:02:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 10260 transitions. [2019-12-18 12:02:27,627 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 10260 transitions. Word has length 14 [2019-12-18 12:02:27,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:27,627 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 10260 transitions. [2019-12-18 12:02:27,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:02:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 10260 transitions. [2019-12-18 12:02:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:02:27,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:27,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:27,631 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:27,631 INFO L82 PathProgramCache]: Analyzing trace with hash 566526627, now seen corresponding path program 1 times [2019-12-18 12:02:27,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:27,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140388599] [2019-12-18 12:02:27,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:27,719 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 12:02:27,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140388599] [2019-12-18 12:02:27,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:27,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:02:27,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497150597] [2019-12-18 12:02:27,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:02:27,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:27,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:02:27,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:02:27,725 INFO L87 Difference]: Start difference. First operand 4245 states and 10260 transitions. Second operand 3 states. [2019-12-18 12:02:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:27,822 INFO L93 Difference]: Finished difference Result 7552 states and 17381 transitions. [2019-12-18 12:02:27,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:02:27,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 12:02:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:27,842 INFO L225 Difference]: With dead ends: 7552 [2019-12-18 12:02:27,842 INFO L226 Difference]: Without dead ends: 7552 [2019-12-18 12:02:27,843 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 12:02:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2019-12-18 12:02:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6526. [2019-12-18 12:02:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-18 12:02:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 15257 transitions. [2019-12-18 12:02:28,057 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 15257 transitions. Word has length 15 [2019-12-18 12:02:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:28,058 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 15257 transitions. [2019-12-18 12:02:28,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:02:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 15257 transitions. [2019-12-18 12:02:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 12:02:28,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:28,060 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 12:02:28,060 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:28,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1206588916, now seen corresponding path program 1 times [2019-12-18 12:02:28,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:28,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923853337] [2019-12-18 12:02:28,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:28,155 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 12:02:28,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923853337] [2019-12-18 12:02:28,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:28,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:02:28,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932165928] [2019-12-18 12:02:28,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:02:28,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:28,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:02:28,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:02:28,157 INFO L87 Difference]: Start difference. First operand 6526 states and 15257 transitions. Second operand 4 states. [2019-12-18 12:02:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:28,449 INFO L93 Difference]: Finished difference Result 7957 states and 18351 transitions. [2019-12-18 12:02:28,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:02:28,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 12:02:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:28,471 INFO L225 Difference]: With dead ends: 7957 [2019-12-18 12:02:28,471 INFO L226 Difference]: Without dead ends: 7957 [2019-12-18 12:02:28,471 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 12:02:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-12-18 12:02:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 6579. [2019-12-18 12:02:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-18 12:02:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 15368 transitions. [2019-12-18 12:02:28,605 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 15368 transitions. Word has length 17 [2019-12-18 12:02:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:28,606 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 15368 transitions. [2019-12-18 12:02:28,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:02:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 15368 transitions. [2019-12-18 12:02:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:02:28,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:28,613 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] [2019-12-18 12:02:28,613 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:28,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1293061293, now seen corresponding path program 1 times [2019-12-18 12:02:28,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:28,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455253266] [2019-12-18 12:02:28,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:28,682 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 12:02:28,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455253266] [2019-12-18 12:02:28,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:28,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:02:28,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858705778] [2019-12-18 12:02:28,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:02:28,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:28,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:02:28,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:02:28,684 INFO L87 Difference]: Start difference. First operand 6579 states and 15368 transitions. Second operand 5 states. [2019-12-18 12:02:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:29,130 INFO L93 Difference]: Finished difference Result 8876 states and 20253 transitions. [2019-12-18 12:02:29,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:02:29,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:02:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:29,159 INFO L225 Difference]: With dead ends: 8876 [2019-12-18 12:02:29,159 INFO L226 Difference]: Without dead ends: 8876 [2019-12-18 12:02:29,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 12:02:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8876 states. [2019-12-18 12:02:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8876 to 8439. [2019-12-18 12:02:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-12-18 12:02:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 19387 transitions. [2019-12-18 12:02:29,328 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 19387 transitions. Word has length 27 [2019-12-18 12:02:29,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:29,328 INFO L462 AbstractCegarLoop]: Abstraction has 8439 states and 19387 transitions. [2019-12-18 12:02:29,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:02:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 19387 transitions. [2019-12-18 12:02:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 12:02:29,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:29,336 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] [2019-12-18 12:02:29,337 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:29,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1277893089, now seen corresponding path program 1 times [2019-12-18 12:02:29,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:29,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425835043] [2019-12-18 12:02:29,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:29,386 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 12:02:29,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425835043] [2019-12-18 12:02:29,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:29,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:02:29,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210902433] [2019-12-18 12:02:29,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:02:29,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:29,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:02:29,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:02:29,388 INFO L87 Difference]: Start difference. First operand 8439 states and 19387 transitions. Second operand 3 states. [2019-12-18 12:02:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:29,479 INFO L93 Difference]: Finished difference Result 9584 states and 20860 transitions. [2019-12-18 12:02:29,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:02:29,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 12:02:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:29,499 INFO L225 Difference]: With dead ends: 9584 [2019-12-18 12:02:29,499 INFO L226 Difference]: Without dead ends: 9584 [2019-12-18 12:02:29,501 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 12:02:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-12-18 12:02:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 8440. [2019-12-18 12:02:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-12-18 12:02:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 18504 transitions. [2019-12-18 12:02:29,781 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 18504 transitions. Word has length 30 [2019-12-18 12:02:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:29,782 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 18504 transitions. [2019-12-18 12:02:29,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:02:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 18504 transitions. [2019-12-18 12:02:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:02:29,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:29,793 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] [2019-12-18 12:02:29,793 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:29,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1657093328, now seen corresponding path program 1 times [2019-12-18 12:02:29,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:29,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735531408] [2019-12-18 12:02:29,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:29,929 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 12:02:29,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735531408] [2019-12-18 12:02:29,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:29,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:02:29,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200144521] [2019-12-18 12:02:29,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:02:29,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:29,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:02:29,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:02:29,932 INFO L87 Difference]: Start difference. First operand 8440 states and 18504 transitions. Second operand 5 states. [2019-12-18 12:02:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:30,345 INFO L93 Difference]: Finished difference Result 9537 states and 20673 transitions. [2019-12-18 12:02:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:02:30,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 12:02:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:30,360 INFO L225 Difference]: With dead ends: 9537 [2019-12-18 12:02:30,360 INFO L226 Difference]: Without dead ends: 9537 [2019-12-18 12:02:30,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 12:02:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-18 12:02:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7558. [2019-12-18 12:02:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7558 states. [2019-12-18 12:02:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7558 states to 7558 states and 16717 transitions. [2019-12-18 12:02:30,503 INFO L78 Accepts]: Start accepts. Automaton has 7558 states and 16717 transitions. Word has length 33 [2019-12-18 12:02:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:30,504 INFO L462 AbstractCegarLoop]: Abstraction has 7558 states and 16717 transitions. [2019-12-18 12:02:30,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:02:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 7558 states and 16717 transitions. [2019-12-18 12:02:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:02:30,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:30,517 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] [2019-12-18 12:02:30,517 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:30,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:30,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1233120795, now seen corresponding path program 1 times [2019-12-18 12:02:30,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:30,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451148464] [2019-12-18 12:02:30,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:30,573 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 12:02:30,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451148464] [2019-12-18 12:02:30,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:30,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:02:30,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802463558] [2019-12-18 12:02:30,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:02:30,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:30,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:02:30,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:02:30,576 INFO L87 Difference]: Start difference. First operand 7558 states and 16717 transitions. Second operand 4 states. [2019-12-18 12:02:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:30,607 INFO L93 Difference]: Finished difference Result 5263 states and 11555 transitions. [2019-12-18 12:02:30,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:02:30,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 12:02:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:30,615 INFO L225 Difference]: With dead ends: 5263 [2019-12-18 12:02:30,615 INFO L226 Difference]: Without dead ends: 5263 [2019-12-18 12:02:30,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:02:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-18 12:02:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5159. [2019-12-18 12:02:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-12-18 12:02:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11362 transitions. [2019-12-18 12:02:30,740 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11362 transitions. Word has length 39 [2019-12-18 12:02:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:30,741 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11362 transitions. [2019-12-18 12:02:30,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:02:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11362 transitions. [2019-12-18 12:02:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 12:02:30,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:30,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:30,760 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash 184713789, now seen corresponding path program 1 times [2019-12-18 12:02:30,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:30,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541091923] [2019-12-18 12:02:30,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:30,974 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 12:02:30,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541091923] [2019-12-18 12:02:30,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:30,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:02:30,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984927007] [2019-12-18 12:02:30,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:02:30,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:02:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:02:30,978 INFO L87 Difference]: Start difference. First operand 5159 states and 11362 transitions. Second operand 8 states. [2019-12-18 12:02:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:31,471 INFO L93 Difference]: Finished difference Result 9824 states and 21398 transitions. [2019-12-18 12:02:31,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:02:31,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-18 12:02:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:31,483 INFO L225 Difference]: With dead ends: 9824 [2019-12-18 12:02:31,483 INFO L226 Difference]: Without dead ends: 8719 [2019-12-18 12:02:31,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:02:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-12-18 12:02:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 6443. [2019-12-18 12:02:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6443 states. [2019-12-18 12:02:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 14388 transitions. [2019-12-18 12:02:31,700 INFO L78 Accepts]: Start accepts. Automaton has 6443 states and 14388 transitions. Word has length 68 [2019-12-18 12:02:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:31,700 INFO L462 AbstractCegarLoop]: Abstraction has 6443 states and 14388 transitions. [2019-12-18 12:02:31,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:02:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 6443 states and 14388 transitions. [2019-12-18 12:02:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 12:02:31,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:31,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:31,716 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:31,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:31,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1779092541, now seen corresponding path program 2 times [2019-12-18 12:02:31,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:31,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761185241] [2019-12-18 12:02:31,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:31,836 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 12:02:31,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761185241] [2019-12-18 12:02:31,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:31,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:02:31,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672960612] [2019-12-18 12:02:31,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:02:31,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:02:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:02:31,839 INFO L87 Difference]: Start difference. First operand 6443 states and 14388 transitions. Second operand 5 states. [2019-12-18 12:02:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:32,035 INFO L93 Difference]: Finished difference Result 9381 states and 20893 transitions. [2019-12-18 12:02:32,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:02:32,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-18 12:02:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:32,050 INFO L225 Difference]: With dead ends: 9381 [2019-12-18 12:02:32,050 INFO L226 Difference]: Without dead ends: 7879 [2019-12-18 12:02:32,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:02:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-12-18 12:02:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7779. [2019-12-18 12:02:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-18 12:02:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 17459 transitions. [2019-12-18 12:02:32,232 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 17459 transitions. Word has length 68 [2019-12-18 12:02:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:32,233 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 17459 transitions. [2019-12-18 12:02:32,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:02:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 17459 transitions. [2019-12-18 12:02:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 12:02:32,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:32,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:32,255 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:32,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:32,256 INFO L82 PathProgramCache]: Analyzing trace with hash 89330341, now seen corresponding path program 3 times [2019-12-18 12:02:32,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:32,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331188109] [2019-12-18 12:02:32,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:32,397 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 12:02:32,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331188109] [2019-12-18 12:02:32,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:32,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:02:32,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755734837] [2019-12-18 12:02:32,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:02:32,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:32,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:02:32,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:02:32,400 INFO L87 Difference]: Start difference. First operand 7779 states and 17459 transitions. Second operand 8 states. [2019-12-18 12:02:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:32,922 INFO L93 Difference]: Finished difference Result 11922 states and 26443 transitions. [2019-12-18 12:02:32,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:02:32,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-18 12:02:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:32,937 INFO L225 Difference]: With dead ends: 11922 [2019-12-18 12:02:32,938 INFO L226 Difference]: Without dead ends: 11455 [2019-12-18 12:02:32,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:02:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11455 states. [2019-12-18 12:02:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 7833. [2019-12-18 12:02:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-12-18 12:02:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 17576 transitions. [2019-12-18 12:02:33,104 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 17576 transitions. Word has length 68 [2019-12-18 12:02:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:33,104 INFO L462 AbstractCegarLoop]: Abstraction has 7833 states and 17576 transitions. [2019-12-18 12:02:33,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:02:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 17576 transitions. [2019-12-18 12:02:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 12:02:33,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:33,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:33,127 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1465739931, now seen corresponding path program 4 times [2019-12-18 12:02:33,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:33,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486297252] [2019-12-18 12:02:33,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:33,250 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 12:02:33,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486297252] [2019-12-18 12:02:33,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:33,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:02:33,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904198981] [2019-12-18 12:02:33,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:02:33,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:02:33,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:02:33,252 INFO L87 Difference]: Start difference. First operand 7833 states and 17576 transitions. Second operand 4 states. [2019-12-18 12:02:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:33,292 INFO L93 Difference]: Finished difference Result 8537 states and 19081 transitions. [2019-12-18 12:02:33,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:02:33,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-18 12:02:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:33,294 INFO L225 Difference]: With dead ends: 8537 [2019-12-18 12:02:33,294 INFO L226 Difference]: Without dead ends: 890 [2019-12-18 12:02:33,298 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 12:02:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-18 12:02:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2019-12-18 12:02:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-18 12:02:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1849 transitions. [2019-12-18 12:02:33,311 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1849 transitions. Word has length 68 [2019-12-18 12:02:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:33,311 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1849 transitions. [2019-12-18 12:02:33,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:02:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1849 transitions. [2019-12-18 12:02:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 12:02:33,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:33,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:33,314 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash 542114771, now seen corresponding path program 1 times [2019-12-18 12:02:33,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:33,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797110849] [2019-12-18 12:02:33,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:33,433 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 12:02:33,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797110849] [2019-12-18 12:02:33,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:33,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:02:33,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556642799] [2019-12-18 12:02:33,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:02:33,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:33,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:02:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:02:33,435 INFO L87 Difference]: Start difference. First operand 890 states and 1849 transitions. Second operand 5 states. [2019-12-18 12:02:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:33,697 INFO L93 Difference]: Finished difference Result 1006 states and 2057 transitions. [2019-12-18 12:02:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:02:33,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-18 12:02:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:33,700 INFO L225 Difference]: With dead ends: 1006 [2019-12-18 12:02:33,700 INFO L226 Difference]: Without dead ends: 1006 [2019-12-18 12:02:33,701 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 12:02:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-12-18 12:02:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 968. [2019-12-18 12:02:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-12-18 12:02:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1990 transitions. [2019-12-18 12:02:33,715 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1990 transitions. Word has length 69 [2019-12-18 12:02:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:33,716 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1990 transitions. [2019-12-18 12:02:33,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:02:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1990 transitions. [2019-12-18 12:02:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 12:02:33,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:33,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:33,718 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:33,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 491973003, now seen corresponding path program 2 times [2019-12-18 12:02:33,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:33,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484030267] [2019-12-18 12:02:33,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:33,920 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 12:02:33,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484030267] [2019-12-18 12:02:33,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:33,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:02:33,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094313051] [2019-12-18 12:02:33,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:02:33,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:33,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:02:33,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:02:33,922 INFO L87 Difference]: Start difference. First operand 968 states and 1990 transitions. Second operand 7 states. [2019-12-18 12:02:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:34,479 INFO L93 Difference]: Finished difference Result 2788 states and 5827 transitions. [2019-12-18 12:02:34,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:02:34,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-18 12:02:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:34,484 INFO L225 Difference]: With dead ends: 2788 [2019-12-18 12:02:34,484 INFO L226 Difference]: Without dead ends: 2788 [2019-12-18 12:02:34,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:02:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2019-12-18 12:02:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 1477. [2019-12-18 12:02:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-12-18 12:02:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 3071 transitions. [2019-12-18 12:02:34,512 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 3071 transitions. Word has length 69 [2019-12-18 12:02:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:34,512 INFO L462 AbstractCegarLoop]: Abstraction has 1477 states and 3071 transitions. [2019-12-18 12:02:34,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:02:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 3071 transitions. [2019-12-18 12:02:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 12:02:34,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:34,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:34,516 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:34,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1127812217, now seen corresponding path program 3 times [2019-12-18 12:02:34,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:34,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295725007] [2019-12-18 12:02:34,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:34,647 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 12:02:34,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295725007] [2019-12-18 12:02:34,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:34,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:02:34,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965898402] [2019-12-18 12:02:34,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:02:34,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:02:34,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:02:34,653 INFO L87 Difference]: Start difference. First operand 1477 states and 3071 transitions. Second operand 7 states. [2019-12-18 12:02:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:35,335 INFO L93 Difference]: Finished difference Result 3082 states and 6189 transitions. [2019-12-18 12:02:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:02:35,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-18 12:02:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:35,340 INFO L225 Difference]: With dead ends: 3082 [2019-12-18 12:02:35,340 INFO L226 Difference]: Without dead ends: 3058 [2019-12-18 12:02:35,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:02:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2019-12-18 12:02:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 1677. [2019-12-18 12:02:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-12-18 12:02:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 3464 transitions. [2019-12-18 12:02:35,368 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 3464 transitions. Word has length 69 [2019-12-18 12:02:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:35,368 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 3464 transitions. [2019-12-18 12:02:35,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:02:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 3464 transitions. [2019-12-18 12:02:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 12:02:35,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:35,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:35,372 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:35,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1081203753, now seen corresponding path program 4 times [2019-12-18 12:02:35,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:35,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83673086] [2019-12-18 12:02:35,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:35,484 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 12:02:35,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83673086] [2019-12-18 12:02:35,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:35,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:02:35,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097539149] [2019-12-18 12:02:35,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:02:35,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:35,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:02:35,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:02:35,487 INFO L87 Difference]: Start difference. First operand 1677 states and 3464 transitions. Second operand 6 states. [2019-12-18 12:02:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:35,772 INFO L93 Difference]: Finished difference Result 1833 states and 3736 transitions. [2019-12-18 12:02:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:02:35,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-18 12:02:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:35,776 INFO L225 Difference]: With dead ends: 1833 [2019-12-18 12:02:35,776 INFO L226 Difference]: Without dead ends: 1833 [2019-12-18 12:02:35,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:02:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2019-12-18 12:02:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1684. [2019-12-18 12:02:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2019-12-18 12:02:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3477 transitions. [2019-12-18 12:02:35,796 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3477 transitions. Word has length 69 [2019-12-18 12:02:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:35,796 INFO L462 AbstractCegarLoop]: Abstraction has 1684 states and 3477 transitions. [2019-12-18 12:02:35,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:02:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3477 transitions. [2019-12-18 12:02:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 12:02:35,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:35,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:35,799 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 378733993, now seen corresponding path program 1 times [2019-12-18 12:02:35,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:35,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898298554] [2019-12-18 12:02:35,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:35,985 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 12:02:35,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898298554] [2019-12-18 12:02:35,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:35,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:02:35,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512928418] [2019-12-18 12:02:35,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:02:35,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:02:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:02:35,992 INFO L87 Difference]: Start difference. First operand 1684 states and 3477 transitions. Second operand 11 states. [2019-12-18 12:02:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:36,628 INFO L93 Difference]: Finished difference Result 2453 states and 4897 transitions. [2019-12-18 12:02:36,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:02:36,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-12-18 12:02:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:36,636 INFO L225 Difference]: With dead ends: 2453 [2019-12-18 12:02:36,636 INFO L226 Difference]: Without dead ends: 2453 [2019-12-18 12:02:36,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:02:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2019-12-18 12:02:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1673. [2019-12-18 12:02:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2019-12-18 12:02:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 3433 transitions. [2019-12-18 12:02:36,655 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 3433 transitions. Word has length 70 [2019-12-18 12:02:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:36,655 INFO L462 AbstractCegarLoop]: Abstraction has 1673 states and 3433 transitions. [2019-12-18 12:02:36,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:02:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 3433 transitions. [2019-12-18 12:02:36,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 12:02:36,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:36,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:36,658 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:36,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1282533711, now seen corresponding path program 2 times [2019-12-18 12:02:36,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:36,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155330990] [2019-12-18 12:02:36,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:36,720 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 12:02:36,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155330990] [2019-12-18 12:02:36,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:36,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:02:36,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803534153] [2019-12-18 12:02:36,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:02:36,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:02:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:02:36,722 INFO L87 Difference]: Start difference. First operand 1673 states and 3433 transitions. Second operand 3 states. [2019-12-18 12:02:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:36,741 INFO L93 Difference]: Finished difference Result 1673 states and 3432 transitions. [2019-12-18 12:02:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:02:36,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-18 12:02:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:36,745 INFO L225 Difference]: With dead ends: 1673 [2019-12-18 12:02:36,745 INFO L226 Difference]: Without dead ends: 1673 [2019-12-18 12:02:36,745 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 12:02:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-18 12:02:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1481. [2019-12-18 12:02:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-12-18 12:02:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 3066 transitions. [2019-12-18 12:02:36,770 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 3066 transitions. Word has length 70 [2019-12-18 12:02:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:36,770 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 3066 transitions. [2019-12-18 12:02:36,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:02:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 3066 transitions. [2019-12-18 12:02:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 12:02:36,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:36,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:36,774 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:36,775 INFO L82 PathProgramCache]: Analyzing trace with hash 978366752, now seen corresponding path program 1 times [2019-12-18 12:02:36,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:36,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754873084] [2019-12-18 12:02:36,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:02:36,933 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 12:02:36,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754873084] [2019-12-18 12:02:36,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:02:36,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:02:36,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776158507] [2019-12-18 12:02:36,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:02:36,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:02:36,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:02:36,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:02:36,935 INFO L87 Difference]: Start difference. First operand 1481 states and 3066 transitions. Second operand 5 states. [2019-12-18 12:02:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:02:37,014 INFO L93 Difference]: Finished difference Result 1639 states and 3382 transitions. [2019-12-18 12:02:37,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:02:37,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-18 12:02:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:02:37,016 INFO L225 Difference]: With dead ends: 1639 [2019-12-18 12:02:37,017 INFO L226 Difference]: Without dead ends: 1639 [2019-12-18 12:02:37,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:02:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-12-18 12:02:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1405. [2019-12-18 12:02:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-12-18 12:02:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2911 transitions. [2019-12-18 12:02:37,036 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2911 transitions. Word has length 70 [2019-12-18 12:02:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:02:37,036 INFO L462 AbstractCegarLoop]: Abstraction has 1405 states and 2911 transitions. [2019-12-18 12:02:37,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:02:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2911 transitions. [2019-12-18 12:02:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 12:02:37,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:02:37,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:02:37,040 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:02:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:02:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1762924738, now seen corresponding path program 1 times [2019-12-18 12:02:37,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:02:37,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612494473] [2019-12-18 12:02:37,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:02:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:02:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:02:37,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:02:37,226 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:02:37,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51| 1)) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t6~0.base_51|) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_51|) |v_ULTIMATE.start_main_~#t6~0.offset_32| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t6~0.base_51|) 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= |v_ULTIMATE.start_main_~#t6~0.offset_32| 0) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t6~0.base_51| 4)) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_997, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ULTIMATE.start_main_~#t6~0.offset=|v_ULTIMATE.start_main_~#t6~0.offset_32|, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ULTIMATE.start_main_~#t6~0.base=|v_ULTIMATE.start_main_~#t6~0.base_51|, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t7~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t7~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t6~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t6~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:02:37,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t7~0.offset_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t7~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11|) |v_ULTIMATE.start_main_~#t7~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t7~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t7~0.base, ULTIMATE.start_main_~#t7~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-18 12:02:37,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= |P0Thread1of1ForFork1_#t~nondet3_In-1333919880| ~weak$$choice0~0_Out-1333919880) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1333919880 0)) (= ~y$r_buff0_thd1~0_In-1333919880 ~y$r_buff1_thd1~0_Out-1333919880) (= ~weak$$choice2~0_Out-1333919880 ~y$flush_delayed~0_Out-1333919880) (= ~y$r_buff1_thd2~0_Out-1333919880 ~y$r_buff0_thd2~0_In-1333919880) (= ~y$r_buff0_thd1~0_Out-1333919880 1) (= ~y~0_In-1333919880 ~y$mem_tmp~0_Out-1333919880) (= ~weak$$choice2~0_Out-1333919880 |P0Thread1of1ForFork1_#t~nondet4_In-1333919880|) (= ~y$r_buff1_thd0~0_Out-1333919880 ~y$r_buff0_thd0~0_In-1333919880)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1333919880, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1333919880, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1333919880, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1333919880, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-1333919880|, ~y~0=~y~0_In-1333919880, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-1333919880|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1333919880, ~weak$$choice0~0=~weak$$choice0~0_Out-1333919880, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1333919880, ~y$mem_tmp~0=~y$mem_tmp~0_Out-1333919880, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1333919880, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1333919880, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1333919880, ~y$flush_delayed~0=~y$flush_delayed~0_Out-1333919880, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1333919880, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-1333919880|, ~y~0=~y~0_In-1333919880, ~weak$$choice2~0=~weak$$choice2~0_Out-1333919880, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-1333919880|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1333919880} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 12:02:37,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1400809432 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1400809432 256) 0)) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out-1400809432| |P0Thread1of1ForFork1_#t~ite5_Out-1400809432|))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork1_#t~ite5_Out-1400809432| ~y$w_buff1~0_In-1400809432)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1400809432| ~y$w_buff0~0_In-1400809432) (not .cse1) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400809432, ~y$w_buff1~0=~y$w_buff1~0_In-1400809432, ~y$w_buff0~0=~y$w_buff0~0_In-1400809432, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1400809432} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1400809432|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400809432, ~y$w_buff1~0=~y$w_buff1~0_In-1400809432, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1400809432|, ~y$w_buff0~0=~y$w_buff0~0_In-1400809432, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1400809432} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:02:37,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_11|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_11|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:02:37,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In156268678 256) 0))) (or (and (= ~y$mem_tmp~0_In156268678 |P0Thread1of1ForFork1_#t~ite25_Out156268678|) (not .cse0)) (and .cse0 (= ~y~0_In156268678 |P0Thread1of1ForFork1_#t~ite25_Out156268678|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In156268678, ~y$flush_delayed~0=~y$flush_delayed~0_In156268678, ~y~0=~y~0_In156268678} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In156268678, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out156268678|, ~y$flush_delayed~0=~y$flush_delayed~0_In156268678, ~y~0=~y~0_In156268678} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 12:02:37,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1183995163 256) 0))) (or (and (= ~y$mem_tmp~0_In1183995163 |P1Thread1of1ForFork0_#t~ite54_Out1183995163|) (not .cse0)) (and (= |P1Thread1of1ForFork0_#t~ite54_Out1183995163| ~y~0_In1183995163) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1183995163, ~y$flush_delayed~0=~y$flush_delayed~0_In1183995163, ~y~0=~y~0_In1183995163} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1183995163, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out1183995163|, ~y$flush_delayed~0=~y$flush_delayed~0_In1183995163, ~y~0=~y~0_In1183995163} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 12:02:37,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-159275847 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-159275847 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite28_Out-159275847|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-159275847 |P0Thread1of1ForFork1_#t~ite28_Out-159275847|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-159275847, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-159275847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-159275847, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-159275847|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-159275847} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 12:02:37,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In737711648 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In737711648 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In737711648 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In737711648 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite29_Out737711648| ~y$w_buff1_used~0_In737711648)) (and (= |P0Thread1of1ForFork1_#t~ite29_Out737711648| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In737711648, ~y$w_buff0_used~0=~y$w_buff0_used~0_In737711648, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In737711648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In737711648} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In737711648, ~y$w_buff0_used~0=~y$w_buff0_used~0_In737711648, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out737711648|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In737711648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In737711648} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 12:02:37,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In533059588 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In533059588 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out533059588)) (and (= ~y$r_buff0_thd1~0_Out533059588 ~y$r_buff0_thd1~0_In533059588) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In533059588, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In533059588} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In533059588, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out533059588, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out533059588|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 12:02:37,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In917329325 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In917329325 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In917329325 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In917329325 256)))) (or (and (= ~y$r_buff1_thd1~0_In917329325 |P0Thread1of1ForFork1_#t~ite31_Out917329325|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out917329325|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In917329325, ~y$w_buff0_used~0=~y$w_buff0_used~0_In917329325, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In917329325, ~y$w_buff1_used~0=~y$w_buff1_used~0_In917329325} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In917329325, ~y$w_buff0_used~0=~y$w_buff0_used~0_In917329325, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In917329325, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out917329325|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In917329325} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 12:02:37,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_36|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_35|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 12:02:37,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-827286205 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-827286205 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-827286205 |P1Thread1of1ForFork0_#t~ite55_Out-827286205|)) (and (or .cse0 .cse1) (= ~y~0_In-827286205 |P1Thread1of1ForFork0_#t~ite55_Out-827286205|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-827286205, ~y$w_buff1~0=~y$w_buff1~0_In-827286205, ~y~0=~y~0_In-827286205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-827286205} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-827286205, ~y$w_buff1~0=~y$w_buff1~0_In-827286205, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-827286205|, ~y~0=~y~0_In-827286205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-827286205} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-18 12:02:37,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_10|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_10|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_13|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_9|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-18 12:02:37,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1043838439 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1043838439 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1043838439 |P1Thread1of1ForFork0_#t~ite57_Out-1043838439|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out-1043838439| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1043838439, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1043838439} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1043838439, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1043838439, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-1043838439|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-18 12:02:37,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-642786791 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-642786791 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-642786791 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-642786791 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite58_Out-642786791| ~y$w_buff1_used~0_In-642786791)) (and (= |P1Thread1of1ForFork0_#t~ite58_Out-642786791| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-642786791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-642786791, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-642786791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-642786791} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-642786791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-642786791, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-642786791, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-642786791|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-642786791} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-18 12:02:37,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1475334145 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1475334145 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1475334145 |P1Thread1of1ForFork0_#t~ite59_Out-1475334145|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1475334145|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1475334145, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1475334145} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1475334145, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1475334145, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1475334145|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-18 12:02:37,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2073533936 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2073533936 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In2073533936 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In2073533936 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite60_Out2073533936| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite60_Out2073533936| ~y$r_buff1_thd2~0_In2073533936)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2073533936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073533936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2073533936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073533936} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2073533936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073533936, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out2073533936|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2073533936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073533936} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-18 12:02:37,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 12:02:37,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:02:37,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite63_Out1776747776| |ULTIMATE.start_main_#t~ite64_Out1776747776|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1776747776 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1776747776 256) 0))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite63_Out1776747776| ~y$w_buff1~0_In1776747776) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite63_Out1776747776| ~y~0_In1776747776) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1776747776, ~y~0=~y~0_In1776747776, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1776747776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1776747776} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1776747776|, ~y$w_buff1~0=~y$w_buff1~0_In1776747776, ~y~0=~y~0_In1776747776, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1776747776, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1776747776|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1776747776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 12:02:37,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In202348202 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In202348202 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite65_Out202348202| ~y$w_buff0_used~0_In202348202)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite65_Out202348202| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In202348202, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In202348202} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In202348202, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In202348202, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out202348202|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-18 12:02:37,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-270530722 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-270530722 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-270530722 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-270530722 256)))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out-270530722| ~y$w_buff1_used~0_In-270530722) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite66_Out-270530722| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-270530722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-270530722, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-270530722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-270530722} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-270530722, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-270530722, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-270530722|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-270530722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-270530722} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-18 12:02:37,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1127911290 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1127911290 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite67_Out-1127911290| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out-1127911290| ~y$r_buff0_thd0~0_In-1127911290) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1127911290, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1127911290} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1127911290, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1127911290, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1127911290|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-18 12:02:37,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-281921685 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-281921685 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-281921685 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-281921685 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite68_Out-281921685| ~y$r_buff1_thd0~0_In-281921685) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite68_Out-281921685|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-281921685, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-281921685, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-281921685, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-281921685} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-281921685, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-281921685, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-281921685|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-281921685, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-281921685} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 12:02:37,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~__unbuffered_p0_EBX~0_46 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|) (= v_~main$tmp_guard1~0_40 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:02:37,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:02:37 BasicIcfg [2019-12-18 12:02:37,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:02:37,385 INFO L168 Benchmark]: Toolchain (without parser) took 24498.03 ms. Allocated memory was 145.2 MB in the beginning and 889.2 MB in the end (delta: 744.0 MB). Free memory was 101.0 MB in the beginning and 637.6 MB in the end (delta: -536.7 MB). Peak memory consumption was 207.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:02:37,386 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:02:37,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.16 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 155.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:02:37,387 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.11 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:02:37,387 INFO L168 Benchmark]: Boogie Preprocessor took 43.57 ms. Allocated memory is still 202.4 MB. Free memory was 152.2 MB in the beginning and 149.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:02:37,388 INFO L168 Benchmark]: RCFGBuilder took 1088.51 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 93.2 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:02:37,389 INFO L168 Benchmark]: TraceAbstraction took 22482.41 ms. Allocated memory was 202.4 MB in the beginning and 889.2 MB in the end (delta: 686.8 MB). Free memory was 92.6 MB in the beginning and 637.6 MB in the end (delta: -545.1 MB). Peak memory consumption was 141.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:02:37,392 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.51 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.16 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 155.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.11 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.57 ms. Allocated memory is still 202.4 MB. Free memory was 152.2 MB in the beginning and 149.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1088.51 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 93.2 MB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22482.41 ms. Allocated memory was 202.4 MB in the beginning and 889.2 MB in the end (delta: 686.8 MB). Free memory was 92.6 MB in the beginning and 637.6 MB in the end (delta: -545.1 MB). Peak memory consumption was 141.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9684 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t6, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L820] FCALL, FORK 0 pthread_create(&t7, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 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, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L784] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 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) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 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 [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 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 [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4541 SDtfs, 4088 SDslu, 10569 SDs, 0 SdLazy, 3916 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 51 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29658occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 16219 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 927 ConstructedInterpolants, 0 QuantifiedInterpolants, 176371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...