/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/mix009_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:22:25,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:22:25,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:22:25,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:22:25,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:22:25,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:22:25,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:22:25,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:22:25,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:22:25,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:22:25,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:22:25,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:22:25,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:22:25,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:22:25,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:22:25,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:22:25,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:22:25,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:22:25,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:22:25,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:22:25,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:22:25,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:22:25,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:22:25,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:22:25,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:22:25,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:22:25,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:22:25,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:22:25,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:22:25,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:22:25,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:22:25,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:22:25,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:22:25,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:22:25,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:22:25,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:22:25,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:22:25,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:22:25,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:22:25,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:22:25,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:22:25,588 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:22:25,610 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:22:25,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:22:25,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:22:25,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:22:25,613 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:22:25,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:22:25,613 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:22:25,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:22:25,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:22:25,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:22:25,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:22:25,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:22:25,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:22:25,616 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:22:25,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:22:25,616 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:22:25,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:22:25,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:22:25,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:22:25,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:22:25,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:22:25,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:22:25,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:22:25,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:22:25,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:22:25,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:22:25,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:22:25,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:22:25,619 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:22:25,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:22:25,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:22:25,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:22:25,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:22:25,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:22:25,923 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:22:25,924 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-18 12:22:25,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20cad87c0/a468afdc7f444002b85f1d451199d602/FLAGef413d9bb [2019-12-18 12:22:26,499 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:22:26,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-18 12:22:26,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20cad87c0/a468afdc7f444002b85f1d451199d602/FLAGef413d9bb [2019-12-18 12:22:26,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20cad87c0/a468afdc7f444002b85f1d451199d602 [2019-12-18 12:22:26,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:22:26,811 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:22:26,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:22:26,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:22:26,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:22:26,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:22:26" (1/1) ... [2019-12-18 12:22:26,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59807402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:26, skipping insertion in model container [2019-12-18 12:22:26,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:22:26" (1/1) ... [2019-12-18 12:22:26,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:22:26,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:22:27,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:22:27,411 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:22:27,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:22:27,583 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:22:27,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27 WrapperNode [2019-12-18 12:22:27,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:22:27,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:22:27,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:22:27,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:22:27,593 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:22:27" (1/1) ... [2019-12-18 12:22:27,612 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:22:27" (1/1) ... [2019-12-18 12:22:27,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:22:27,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:22:27,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:22:27,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:22:27,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27" (1/1) ... [2019-12-18 12:22:27,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27" (1/1) ... [2019-12-18 12:22:27,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27" (1/1) ... [2019-12-18 12:22:27,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27" (1/1) ... [2019-12-18 12:22:27,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27" (1/1) ... [2019-12-18 12:22:27,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27" (1/1) ... [2019-12-18 12:22:27,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27" (1/1) ... [2019-12-18 12:22:27,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:22:27,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:22:27,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:22:27,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:22:27,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27" (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:22:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:22:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:22:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:22:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:22:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:22:27,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:22:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:22:27,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:22:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:22:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:22:27,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:22:27,766 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:22:28,502 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:22:28,502 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:22:28,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:22:28 BoogieIcfgContainer [2019-12-18 12:22:28,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:22:28,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:22:28,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:22:28,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:22:28,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:22:26" (1/3) ... [2019-12-18 12:22:28,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7756db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:22:28, skipping insertion in model container [2019-12-18 12:22:28,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:27" (2/3) ... [2019-12-18 12:22:28,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7756db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:22:28, skipping insertion in model container [2019-12-18 12:22:28,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:22:28" (3/3) ... [2019-12-18 12:22:28,511 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_pso.oepc.i [2019-12-18 12:22:28,521 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:22:28,521 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:22:28,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:22:28,531 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:22:28,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,570 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,570 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,627 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,628 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,628 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:22:28,655 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 12:22:28,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:22:28,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:22:28,679 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:22:28,679 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:22:28,679 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:22:28,679 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:22:28,679 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:22:28,679 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:22:28,702 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-12-18 12:22:28,704 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-18 12:22:28,783 INFO L126 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-18 12:22:28,784 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:22:28,799 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:22:28,818 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-18 12:22:28,886 INFO L126 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-18 12:22:28,886 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:22:28,895 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:22:28,913 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 12:22:28,914 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:22:33,817 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 12:22:34,287 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 12:22:34,390 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 12:22:34,411 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54623 [2019-12-18 12:22:34,411 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 12:22:34,415 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-18 12:22:34,892 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 12:22:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 12:22:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:22:34,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:34,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:22:34,906 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:22:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash 798193, now seen corresponding path program 1 times [2019-12-18 12:22:34,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:34,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723121602] [2019-12-18 12:22:34,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:35,138 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:22:35,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723121602] [2019-12-18 12:22:35,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:35,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:22:35,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183181393] [2019-12-18 12:22:35,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:22:35,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:22:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:22:35,174 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 12:22:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:35,445 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-12-18 12:22:35,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:22:35,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:22:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:35,547 INFO L225 Difference]: With dead ends: 8466 [2019-12-18 12:22:35,547 INFO L226 Difference]: Without dead ends: 7974 [2019-12-18 12:22:35,548 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:22:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-18 12:22:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-18 12:22:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-18 12:22:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-12-18 12:22:36,037 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-12-18 12:22:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:36,037 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-12-18 12:22:36,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:22:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-12-18 12:22:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:22:36,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:36,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:22:36,044 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:22:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1209832272, now seen corresponding path program 1 times [2019-12-18 12:22:36,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:36,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728340015] [2019-12-18 12:22:36,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:36,102 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:22:36,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728340015] [2019-12-18 12:22:36,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:36,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:22:36,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331691818] [2019-12-18 12:22:36,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:22:36,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:36,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:22:36,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:22:36,105 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 3 states. [2019-12-18 12:22:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:36,143 INFO L93 Difference]: Finished difference Result 1283 states and 2944 transitions. [2019-12-18 12:22:36,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:22:36,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 12:22:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:36,150 INFO L225 Difference]: With dead ends: 1283 [2019-12-18 12:22:36,151 INFO L226 Difference]: Without dead ends: 1283 [2019-12-18 12:22:36,153 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:22:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-18 12:22:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-18 12:22:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-18 12:22:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2944 transitions. [2019-12-18 12:22:36,193 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2944 transitions. Word has length 11 [2019-12-18 12:22:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:36,194 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2944 transitions. [2019-12-18 12:22:36,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:22:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2944 transitions. [2019-12-18 12:22:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:22:36,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:36,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:22:36,196 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:22:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash 768793875, now seen corresponding path program 1 times [2019-12-18 12:22:36,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:36,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213764272] [2019-12-18 12:22:36,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:36,345 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:22:36,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213764272] [2019-12-18 12:22:36,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:36,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:22:36,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209403513] [2019-12-18 12:22:36,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:22:36,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:36,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:22:36,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:22:36,348 INFO L87 Difference]: Start difference. First operand 1283 states and 2944 transitions. Second operand 5 states. [2019-12-18 12:22:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:36,654 INFO L93 Difference]: Finished difference Result 1902 states and 4249 transitions. [2019-12-18 12:22:36,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:22:36,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 12:22:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:36,665 INFO L225 Difference]: With dead ends: 1902 [2019-12-18 12:22:36,665 INFO L226 Difference]: Without dead ends: 1902 [2019-12-18 12:22:36,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:22:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-12-18 12:22:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1604. [2019-12-18 12:22:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-18 12:22:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3640 transitions. [2019-12-18 12:22:36,716 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3640 transitions. Word has length 14 [2019-12-18 12:22:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:36,716 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3640 transitions. [2019-12-18 12:22:36,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:22:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3640 transitions. [2019-12-18 12:22:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:22:36,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:36,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:22:36,722 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:22:36,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash -845336479, now seen corresponding path program 1 times [2019-12-18 12:22:36,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:36,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035957286] [2019-12-18 12:22:36,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:36,907 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:22:36,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035957286] [2019-12-18 12:22:36,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:36,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:22:36,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702345794] [2019-12-18 12:22:36,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:22:36,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:36,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:22:36,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:22:36,909 INFO L87 Difference]: Start difference. First operand 1604 states and 3640 transitions. Second operand 6 states. [2019-12-18 12:22:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:37,311 INFO L93 Difference]: Finished difference Result 2385 states and 5172 transitions. [2019-12-18 12:22:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:22:37,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 12:22:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:37,326 INFO L225 Difference]: With dead ends: 2385 [2019-12-18 12:22:37,329 INFO L226 Difference]: Without dead ends: 2385 [2019-12-18 12:22:37,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:22:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-12-18 12:22:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1725. [2019-12-18 12:22:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-12-18 12:22:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3880 transitions. [2019-12-18 12:22:37,379 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3880 transitions. Word has length 25 [2019-12-18 12:22:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:37,380 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3880 transitions. [2019-12-18 12:22:37,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:22:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3880 transitions. [2019-12-18 12:22:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:22:37,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:37,383 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] [2019-12-18 12:22:37,383 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:22:37,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1948393738, now seen corresponding path program 1 times [2019-12-18 12:22:37,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:37,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197495116] [2019-12-18 12:22:37,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:37,495 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:22:37,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197495116] [2019-12-18 12:22:37,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:37,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:22:37,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185647427] [2019-12-18 12:22:37,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:22:37,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:22:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:22:37,497 INFO L87 Difference]: Start difference. First operand 1725 states and 3880 transitions. Second operand 3 states. [2019-12-18 12:22:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:37,509 INFO L93 Difference]: Finished difference Result 1724 states and 3878 transitions. [2019-12-18 12:22:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:22:37,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 12:22:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:37,519 INFO L225 Difference]: With dead ends: 1724 [2019-12-18 12:22:37,519 INFO L226 Difference]: Without dead ends: 1724 [2019-12-18 12:22:37,519 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:22:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-18 12:22:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2019-12-18 12:22:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-12-18 12:22:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3878 transitions. [2019-12-18 12:22:37,557 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3878 transitions. Word has length 26 [2019-12-18 12:22:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:37,558 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3878 transitions. [2019-12-18 12:22:37,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:22:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3878 transitions. [2019-12-18 12:22:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:22:37,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:37,561 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:22:37,561 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:22:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:37,562 INFO L82 PathProgramCache]: Analyzing trace with hash -50148810, now seen corresponding path program 1 times [2019-12-18 12:22:37,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:37,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491158219] [2019-12-18 12:22:37,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:37,757 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:22:37,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491158219] [2019-12-18 12:22:37,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:37,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:22:37,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493317687] [2019-12-18 12:22:37,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:22:37,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:37,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:22:37,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:22:37,760 INFO L87 Difference]: Start difference. First operand 1724 states and 3878 transitions. Second operand 5 states. [2019-12-18 12:22:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:38,271 INFO L93 Difference]: Finished difference Result 2512 states and 5536 transitions. [2019-12-18 12:22:38,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:22:38,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:22:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:38,286 INFO L225 Difference]: With dead ends: 2512 [2019-12-18 12:22:38,286 INFO L226 Difference]: Without dead ends: 2512 [2019-12-18 12:22:38,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:22:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-12-18 12:22:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2217. [2019-12-18 12:22:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-18 12:22:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 4954 transitions. [2019-12-18 12:22:38,343 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 4954 transitions. Word has length 27 [2019-12-18 12:22:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:38,344 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 4954 transitions. [2019-12-18 12:22:38,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:22:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 4954 transitions. [2019-12-18 12:22:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:22:38,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:38,348 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] [2019-12-18 12:22:38,348 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:22:38,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:38,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1337227567, now seen corresponding path program 1 times [2019-12-18 12:22:38,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:38,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953386596] [2019-12-18 12:22:38,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:38,408 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:22:38,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953386596] [2019-12-18 12:22:38,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:38,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:22:38,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692699573] [2019-12-18 12:22:38,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:22:38,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:38,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:22:38,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:22:38,411 INFO L87 Difference]: Start difference. First operand 2217 states and 4954 transitions. Second operand 4 states. [2019-12-18 12:22:38,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:38,425 INFO L93 Difference]: Finished difference Result 1233 states and 2633 transitions. [2019-12-18 12:22:38,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:22:38,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 12:22:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:38,431 INFO L225 Difference]: With dead ends: 1233 [2019-12-18 12:22:38,431 INFO L226 Difference]: Without dead ends: 1233 [2019-12-18 12:22:38,432 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:22:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-12-18 12:22:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1144. [2019-12-18 12:22:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-18 12:22:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2469 transitions. [2019-12-18 12:22:38,458 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2469 transitions. Word has length 28 [2019-12-18 12:22:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:38,458 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2469 transitions. [2019-12-18 12:22:38,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:22:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2469 transitions. [2019-12-18 12:22:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:22:38,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:38,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:22:38,462 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:22:38,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2075557978, now seen corresponding path program 1 times [2019-12-18 12:22:38,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:38,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283002870] [2019-12-18 12:22:38,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:38,502 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:22:38,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283002870] [2019-12-18 12:22:38,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:38,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:22:38,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246801159] [2019-12-18 12:22:38,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:22:38,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:38,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:22:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:22:38,505 INFO L87 Difference]: Start difference. First operand 1144 states and 2469 transitions. Second operand 3 states. [2019-12-18 12:22:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:38,551 INFO L93 Difference]: Finished difference Result 1748 states and 3666 transitions. [2019-12-18 12:22:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:22:38,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 12:22:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:38,556 INFO L225 Difference]: With dead ends: 1748 [2019-12-18 12:22:38,556 INFO L226 Difference]: Without dead ends: 1748 [2019-12-18 12:22:38,556 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:22:38,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-18 12:22:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1269. [2019-12-18 12:22:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2019-12-18 12:22:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2718 transitions. [2019-12-18 12:22:38,586 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2718 transitions. Word has length 51 [2019-12-18 12:22:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:38,586 INFO L462 AbstractCegarLoop]: Abstraction has 1269 states and 2718 transitions. [2019-12-18 12:22:38,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:22:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2718 transitions. [2019-12-18 12:22:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:22:38,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:38,590 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] [2019-12-18 12:22:38,590 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:22:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash -175297467, now seen corresponding path program 1 times [2019-12-18 12:22:38,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:38,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009483185] [2019-12-18 12:22:38,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:38,676 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:22:38,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009483185] [2019-12-18 12:22:38,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:38,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:22:38,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299782757] [2019-12-18 12:22:38,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:22:38,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:38,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:22:38,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:22:38,678 INFO L87 Difference]: Start difference. First operand 1269 states and 2718 transitions. Second operand 7 states. [2019-12-18 12:22:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:38,995 INFO L93 Difference]: Finished difference Result 3420 states and 7139 transitions. [2019-12-18 12:22:38,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:22:38,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 12:22:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:39,002 INFO L225 Difference]: With dead ends: 3420 [2019-12-18 12:22:39,003 INFO L226 Difference]: Without dead ends: 2222 [2019-12-18 12:22:39,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:22:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2019-12-18 12:22:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1320. [2019-12-18 12:22:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-12-18 12:22:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2818 transitions. [2019-12-18 12:22:39,099 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2818 transitions. Word has length 51 [2019-12-18 12:22:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:39,099 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 2818 transitions. [2019-12-18 12:22:39,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:22:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2818 transitions. [2019-12-18 12:22:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:22:39,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:39,103 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] [2019-12-18 12:22:39,104 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:22:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:39,104 INFO L82 PathProgramCache]: Analyzing trace with hash -128483093, now seen corresponding path program 2 times [2019-12-18 12:22:39,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:39,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760882641] [2019-12-18 12:22:39,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:39,274 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:22:39,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760882641] [2019-12-18 12:22:39,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:39,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:22:39,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461121556] [2019-12-18 12:22:39,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:22:39,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:39,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:22:39,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:22:39,278 INFO L87 Difference]: Start difference. First operand 1320 states and 2818 transitions. Second operand 3 states. [2019-12-18 12:22:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:39,296 INFO L93 Difference]: Finished difference Result 1319 states and 2816 transitions. [2019-12-18 12:22:39,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:22:39,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 12:22:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:39,301 INFO L225 Difference]: With dead ends: 1319 [2019-12-18 12:22:39,301 INFO L226 Difference]: Without dead ends: 1319 [2019-12-18 12:22:39,302 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:22:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-12-18 12:22:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1128. [2019-12-18 12:22:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-12-18 12:22:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2448 transitions. [2019-12-18 12:22:39,332 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2448 transitions. Word has length 51 [2019-12-18 12:22:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:39,334 INFO L462 AbstractCegarLoop]: Abstraction has 1128 states and 2448 transitions. [2019-12-18 12:22:39,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:22:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2448 transitions. [2019-12-18 12:22:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 12:22:39,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:39,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:22:39,338 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:22:39,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash 529376956, now seen corresponding path program 1 times [2019-12-18 12:22:39,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:39,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661053355] [2019-12-18 12:22:39,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:22:39,482 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:22:39,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661053355] [2019-12-18 12:22:39,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:22:39,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:22:39,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088868525] [2019-12-18 12:22:39,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:22:39,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:22:39,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:22:39,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:22:39,485 INFO L87 Difference]: Start difference. First operand 1128 states and 2448 transitions. Second operand 4 states. [2019-12-18 12:22:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:22:39,546 INFO L93 Difference]: Finished difference Result 1374 states and 2961 transitions. [2019-12-18 12:22:39,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:22:39,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 12:22:39,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:22:39,550 INFO L225 Difference]: With dead ends: 1374 [2019-12-18 12:22:39,551 INFO L226 Difference]: Without dead ends: 1374 [2019-12-18 12:22:39,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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:22:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2019-12-18 12:22:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1083. [2019-12-18 12:22:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-12-18 12:22:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2384 transitions. [2019-12-18 12:22:39,575 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 2384 transitions. Word has length 52 [2019-12-18 12:22:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:22:39,576 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 2384 transitions. [2019-12-18 12:22:39,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:22:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2384 transitions. [2019-12-18 12:22:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:22:39,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:22:39,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:22:39,579 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:22:39,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:22:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash -690859281, now seen corresponding path program 1 times [2019-12-18 12:22:39,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:22:39,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658178134] [2019-12-18 12:22:39,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:22:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:22:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:22:39,802 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:22:39,803 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:22:39,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t245~0.base_34|) (= v_~z$w_buff1~0_283 0) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34|)) (= v_~z$w_buff0~0_493 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t245~0.base_34| 4)) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t245~0.offset_22|) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34|) |v_ULTIMATE.start_main_~#t245~0.offset_22| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_cnt~0_48) (= (store .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34| 1) |v_#valid_57|) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t245~0.offset=|v_ULTIMATE.start_main_~#t245~0.offset_22|, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ULTIMATE.start_main_~#t245~0.base=|v_ULTIMATE.start_main_~#t245~0.base_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_21|, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t245~0.offset, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t245~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t246~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t246~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:22:39,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= ~x~0_Out2006232693 ~__unbuffered_p0_EAX~0_Out2006232693) (= ~z$r_buff0_thd1~0_In2006232693 ~z$r_buff1_thd1~0_Out2006232693) (= 1 ~x~0_Out2006232693) (= 1 ~z$r_buff0_thd1~0_Out2006232693) (= ~z$r_buff1_thd0~0_Out2006232693 ~z$r_buff0_thd0~0_In2006232693) (= ~y~0_In2006232693 ~__unbuffered_p0_EBX~0_Out2006232693) (= ~z$r_buff0_thd2~0_In2006232693 ~z$r_buff1_thd2~0_Out2006232693) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2006232693))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2006232693, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2006232693, ~y~0=~y~0_In2006232693, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2006232693, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2006232693} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out2006232693, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2006232693, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out2006232693, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2006232693, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out2006232693, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out2006232693, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2006232693, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2006232693, ~y~0=~y~0_In2006232693, ~x~0=~x~0_Out2006232693, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2006232693} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:22:39,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) |v_ULTIMATE.start_main_~#t246~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t246~0.base_12|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t246~0.base_12| 4) |v_#length_11|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t246~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_12|, #length=|v_#length_11|, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t246~0.base, #length, ULTIMATE.start_main_~#t246~0.offset] because there is no mapped edge [2019-12-18 12:22:39,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1993811594 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1993811594 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1993811594 256)) .cse0) (and (= 0 (mod ~z$r_buff1_thd2~0_In-1993811594 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1993811594 256)))) (= ~z$w_buff0_used~0_In-1993811594 |P1Thread1of1ForFork1_#t~ite20_Out-1993811594|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1993811594| |P1Thread1of1ForFork1_#t~ite20_Out-1993811594|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1993811594| |P1Thread1of1ForFork1_#t~ite20_Out-1993811594|) (not .cse1) (= ~z$w_buff0_used~0_In-1993811594 |P1Thread1of1ForFork1_#t~ite21_Out-1993811594|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993811594, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1993811594|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1993811594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993811594, ~weak$$choice2~0=~weak$$choice2~0_In-1993811594, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1993811594} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993811594, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1993811594|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1993811594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993811594, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1993811594|, ~weak$$choice2~0=~weak$$choice2~0_In-1993811594, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1993811594} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 12:22:39,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 12:22:39,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2044808937 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-2044808937| |P1Thread1of1ForFork1_#t~ite29_Out-2044808937|) (= |P1Thread1of1ForFork1_#t~ite30_Out-2044808937| ~z$r_buff1_thd2~0_In-2044808937) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-2044808937| ~z$r_buff1_thd2~0_In-2044808937) (= |P1Thread1of1ForFork1_#t~ite30_Out-2044808937| |P1Thread1of1ForFork1_#t~ite29_Out-2044808937|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2044808937 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-2044808937 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-2044808937 256) 0) (and (= (mod ~z$r_buff1_thd2~0_In-2044808937 256) 0) .cse1)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2044808937|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2044808937, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2044808937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2044808937, ~weak$$choice2~0=~weak$$choice2~0_In-2044808937, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2044808937} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2044808937|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2044808937|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2044808937, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2044808937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2044808937, ~weak$$choice2~0=~weak$$choice2~0_In-2044808937, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2044808937} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 12:22:39,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:22:39,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out1012150704| |P1Thread1of1ForFork1_#t~ite33_Out1012150704|)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1012150704 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1012150704 256) 0))) (or (and .cse0 (= ~z~0_In1012150704 |P1Thread1of1ForFork1_#t~ite32_Out1012150704|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out1012150704| ~z$w_buff1~0_In1012150704)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1012150704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1012150704, ~z$w_buff1~0=~z$w_buff1~0_In1012150704, ~z~0=~z~0_In1012150704} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1012150704, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1012150704, ~z$w_buff1~0=~z$w_buff1~0_In1012150704, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1012150704|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1012150704|, ~z~0=~z~0_In1012150704} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 12:22:39,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1555996003 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1555996003 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1555996003| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1555996003| ~z$w_buff0_used~0_In1555996003) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1555996003, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1555996003} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1555996003, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1555996003|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1555996003} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 12:22:39,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-943064525 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-943064525 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-943064525 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-943064525 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-943064525| ~z$w_buff1_used~0_In-943064525) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite35_Out-943064525| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-943064525, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-943064525, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-943064525, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-943064525} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-943064525, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-943064525, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-943064525, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-943064525|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-943064525} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 12:22:39,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1942954635 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1942954635 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1942954635| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1942954635| ~z$r_buff0_thd2~0_In-1942954635)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1942954635, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1942954635} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1942954635, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1942954635, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1942954635|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 12:22:39,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In370458971 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In370458971 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out370458971| ~z$w_buff0_used~0_In370458971)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out370458971| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In370458971, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In370458971} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out370458971|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In370458971, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In370458971} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 12:22:39,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1061014541 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1061014541 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1061014541 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1061014541 256)))) (or (and (= ~z$w_buff1_used~0_In1061014541 |P0Thread1of1ForFork0_#t~ite6_Out1061014541|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1061014541| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1061014541, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1061014541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1061014541, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1061014541} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1061014541|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1061014541, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1061014541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1061014541, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1061014541} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 12:22:39,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1613405515 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1613405515 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1613405515 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1613405515 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1613405515| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out1613405515| ~z$r_buff1_thd2~0_In1613405515) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1613405515, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1613405515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1613405515, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1613405515} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1613405515, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1613405515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1613405515, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1613405515, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1613405515|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:22:39,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_24|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:22:39,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1969760538 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1969760538 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1969760538 ~z$r_buff0_thd1~0_In1969760538)) (and (= ~z$r_buff0_thd1~0_Out1969760538 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1969760538, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1969760538} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1969760538, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1969760538|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1969760538} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:22:39,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In2104177035 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2104177035 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In2104177035 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In2104177035 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2104177035|)) (and (= ~z$r_buff1_thd1~0_In2104177035 |P0Thread1of1ForFork0_#t~ite8_Out2104177035|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2104177035, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2104177035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2104177035, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2104177035} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2104177035, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2104177035|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2104177035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2104177035, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2104177035} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 12:22:39,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:22:39,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 12:22:39,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-418748049 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-418748049 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-418748049| ~z$w_buff1~0_In-418748049) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-418748049| ~z~0_In-418748049)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-418748049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-418748049, ~z$w_buff1~0=~z$w_buff1~0_In-418748049, ~z~0=~z~0_In-418748049} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-418748049|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-418748049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-418748049, ~z$w_buff1~0=~z$w_buff1~0_In-418748049, ~z~0=~z~0_In-418748049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 12:22:39,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-18 12:22:39,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-307921557 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-307921557 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-307921557| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-307921557 |ULTIMATE.start_main_#t~ite42_Out-307921557|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-307921557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-307921557} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-307921557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-307921557, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-307921557|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:22:39,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1217775758 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1217775758 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1217775758 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1217775758 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1217775758| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite43_Out-1217775758| ~z$w_buff1_used~0_In-1217775758) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1217775758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217775758, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1217775758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1217775758} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1217775758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217775758, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1217775758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1217775758, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1217775758|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 12:22:39,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-522983178 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-522983178 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-522983178|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-522983178 |ULTIMATE.start_main_#t~ite44_Out-522983178|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-522983178, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-522983178} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-522983178, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-522983178, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-522983178|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:22:39,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In824207297 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In824207297 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In824207297 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In824207297 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out824207297| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out824207297| ~z$r_buff1_thd0~0_In824207297) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In824207297, ~z$w_buff0_used~0=~z$w_buff0_used~0_In824207297, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In824207297, ~z$w_buff1_used~0=~z$w_buff1_used~0_In824207297} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In824207297, ~z$w_buff0_used~0=~z$w_buff0_used~0_In824207297, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In824207297, ~z$w_buff1_used~0=~z$w_buff1_used~0_In824207297, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out824207297|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:22:39,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p0_EBX~0_116 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:22:39,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:22:39 BasicIcfg [2019-12-18 12:22:39,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:22:39,906 INFO L168 Benchmark]: Toolchain (without parser) took 13094.36 ms. Allocated memory was 140.0 MB in the beginning and 424.7 MB in the end (delta: 284.7 MB). Free memory was 102.3 MB in the beginning and 196.4 MB in the end (delta: -94.0 MB). Peak memory consumption was 190.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:22:39,907 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:22:39,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.46 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 160.0 MB in the end (delta: -58.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:22:39,908 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.72 ms. Allocated memory is still 204.5 MB. Free memory was 160.0 MB in the beginning and 157.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:22:39,910 INFO L168 Benchmark]: Boogie Preprocessor took 47.08 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 155.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:22:39,911 INFO L168 Benchmark]: RCFGBuilder took 813.68 ms. Allocated memory is still 204.5 MB. Free memory was 155.4 MB in the beginning and 110.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:22:39,912 INFO L168 Benchmark]: TraceAbstraction took 11398.24 ms. Allocated memory was 204.5 MB in the beginning and 424.7 MB in the end (delta: 220.2 MB). Free memory was 110.1 MB in the beginning and 196.4 MB in the end (delta: -86.3 MB). Peak memory consumption was 133.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:22:39,919 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.46 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 160.0 MB in the end (delta: -58.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.72 ms. Allocated memory is still 204.5 MB. Free memory was 160.0 MB in the beginning and 157.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.08 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 155.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.68 ms. Allocated memory is still 204.5 MB. Free memory was 155.4 MB in the beginning and 110.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11398.24 ms. Allocated memory was 204.5 MB in the beginning and 424.7 MB in the end (delta: 220.2 MB). Free memory was 110.1 MB in the beginning and 196.4 MB in the end (delta: -86.3 MB). Peak memory consumption was 133.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 4687 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 206 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 54623 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t245, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t246, ((void *)0), P1, ((void *)0)) 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=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z 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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$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=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$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=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z 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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1444 SDtfs, 1138 SDslu, 2606 SDs, 0 SdLazy, 1183 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 3205 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 63372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...