/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:21:24,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:21:24,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:21:24,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:21:24,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:21:24,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:21:24,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:21:24,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:21:24,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:21:24,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:21:24,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:21:24,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:21:24,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:21:24,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:21:24,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:21:24,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:21:24,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:21:24,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:21:24,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:21:24,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:21:24,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:21:24,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:21:24,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:21:24,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:21:24,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:21:24,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:21:24,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:21:24,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:21:24,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:21:24,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:21:24,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:21:24,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:21:24,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:21:24,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:21:24,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:21:24,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:21:24,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:21:24,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:21:24,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:21:24,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:21:24,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:21:24,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:21:24,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:21:24,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:21:24,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:21:24,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:21:24,689 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:21:24,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:21:24,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:21:24,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:21:24,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:21:24,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:21:24,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:21:24,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:21:24,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:21:24,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:21:24,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:21:24,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:21:24,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:21:24,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:21:24,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:21:24,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:21:24,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:21:24,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:21:24,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:21:24,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:21:24,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:21:24,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:21:24,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:21:24,694 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:21:24,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:21:24,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:21:25,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:21:25,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:21:25,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:21:25,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:21:25,024 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:21:25,025 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_rmo.opt.i [2019-12-18 21:21:25,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f94a0bc4/de2a3124a34b4a00adc0f52a559e6bd1/FLAGab6753294 [2019-12-18 21:21:25,659 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:21:25,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_rmo.opt.i [2019-12-18 21:21:25,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f94a0bc4/de2a3124a34b4a00adc0f52a559e6bd1/FLAGab6753294 [2019-12-18 21:21:25,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f94a0bc4/de2a3124a34b4a00adc0f52a559e6bd1 [2019-12-18 21:21:25,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:21:25,960 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:21:25,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:21:25,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:21:25,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:21:25,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:21:25" (1/1) ... [2019-12-18 21:21:25,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:25, skipping insertion in model container [2019-12-18 21:21:25,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:21:25" (1/1) ... [2019-12-18 21:21:25,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:21:26,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:21:26,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:21:26,541 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:21:26,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:21:26,727 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:21:26,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26 WrapperNode [2019-12-18 21:21:26,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:21:26,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:21:26,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:21:26,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:21:26,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (1/1) ... [2019-12-18 21:21:26,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (1/1) ... [2019-12-18 21:21:26,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:21:26,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:21:26,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:21:26,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:21:26,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (1/1) ... [2019-12-18 21:21:26,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (1/1) ... [2019-12-18 21:21:26,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (1/1) ... [2019-12-18 21:21:26,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (1/1) ... [2019-12-18 21:21:26,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (1/1) ... [2019-12-18 21:21:26,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (1/1) ... [2019-12-18 21:21:26,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (1/1) ... [2019-12-18 21:21:26,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:21:26,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:21:26,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:21:26,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:21:26,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (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 21:21:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:21:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:21:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:21:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:21:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:21:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:21:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:21:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:21:26,916 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:21:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:21:26,916 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:21:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:21:26,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:21:26,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:21:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:21:26,919 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 21:21:27,629 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:21:27,630 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:21:27,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:21:27 BoogieIcfgContainer [2019-12-18 21:21:27,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:21:27,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:21:27,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:21:27,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:21:27,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:21:25" (1/3) ... [2019-12-18 21:21:27,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a3f23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:21:27, skipping insertion in model container [2019-12-18 21:21:27,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:21:26" (2/3) ... [2019-12-18 21:21:27,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a3f23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:21:27, skipping insertion in model container [2019-12-18 21:21:27,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:21:27" (3/3) ... [2019-12-18 21:21:27,640 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_rmo.opt.i [2019-12-18 21:21:27,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:21:27,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:21:27,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:21:27,666 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:21:27,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,733 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,733 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,736 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,736 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,741 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,741 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,787 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,787 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,788 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,788 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,788 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,796 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,796 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,796 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,796 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,804 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,806 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,831 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,834 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,834 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,835 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,838 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,839 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,843 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,843 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:21:27,854 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:21:27,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:21:27,869 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:21:27,869 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:21:27,869 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:21:27,869 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:21:27,869 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:21:27,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:21:27,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:21:27,887 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-18 21:21:27,889 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-18 21:21:27,974 INFO L126 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-18 21:21:27,975 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:21:27,991 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:21:28,014 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-18 21:21:28,078 INFO L126 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-18 21:21:28,078 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:21:28,084 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 21:21:28,100 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 21:21:28,102 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:21:31,192 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-12-18 21:21:31,712 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:21:31,836 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:21:32,146 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 21:21:32,322 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 21:21:32,343 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50510 [2019-12-18 21:21:32,343 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 21:21:32,347 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 88 transitions [2019-12-18 21:21:34,562 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 30990 states. [2019-12-18 21:21:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 30990 states. [2019-12-18 21:21:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:21:34,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:34,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:21:34,572 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1670049475, now seen corresponding path program 1 times [2019-12-18 21:21:34,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:34,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807373177] [2019-12-18 21:21:34,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:34,857 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 21:21:34,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807373177] [2019-12-18 21:21:34,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:34,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:21:34,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002109771] [2019-12-18 21:21:34,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:21:34,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:21:34,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:21:34,889 INFO L87 Difference]: Start difference. First operand 30990 states. Second operand 3 states. [2019-12-18 21:21:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:36,188 INFO L93 Difference]: Finished difference Result 29806 states and 128112 transitions. [2019-12-18 21:21:36,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:21:36,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:21:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:36,464 INFO L225 Difference]: With dead ends: 29806 [2019-12-18 21:21:36,464 INFO L226 Difference]: Without dead ends: 28014 [2019-12-18 21:21:36,466 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 21:21:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28014 states. [2019-12-18 21:21:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28014 to 28014. [2019-12-18 21:21:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28014 states. [2019-12-18 21:21:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28014 states to 28014 states and 120256 transitions. [2019-12-18 21:21:39,381 INFO L78 Accepts]: Start accepts. Automaton has 28014 states and 120256 transitions. Word has length 9 [2019-12-18 21:21:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:39,383 INFO L462 AbstractCegarLoop]: Abstraction has 28014 states and 120256 transitions. [2019-12-18 21:21:39,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:21:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 28014 states and 120256 transitions. [2019-12-18 21:21:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:21:39,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:39,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:21:39,409 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:39,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash 165441832, now seen corresponding path program 1 times [2019-12-18 21:21:39,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:39,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080072421] [2019-12-18 21:21:39,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:39,529 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 21:21:39,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080072421] [2019-12-18 21:21:39,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:39,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:21:39,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473742812] [2019-12-18 21:21:39,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:21:39,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:39,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:21:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:21:39,532 INFO L87 Difference]: Start difference. First operand 28014 states and 120256 transitions. Second operand 3 states. [2019-12-18 21:21:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:39,866 INFO L93 Difference]: Finished difference Result 22347 states and 89103 transitions. [2019-12-18 21:21:39,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:21:39,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:21:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:40,020 INFO L225 Difference]: With dead ends: 22347 [2019-12-18 21:21:40,021 INFO L226 Difference]: Without dead ends: 22347 [2019-12-18 21:21:40,022 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 21:21:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2019-12-18 21:21:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 22347. [2019-12-18 21:21:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22347 states. [2019-12-18 21:21:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22347 states to 22347 states and 89103 transitions. [2019-12-18 21:21:41,065 INFO L78 Accepts]: Start accepts. Automaton has 22347 states and 89103 transitions. Word has length 15 [2019-12-18 21:21:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:41,066 INFO L462 AbstractCegarLoop]: Abstraction has 22347 states and 89103 transitions. [2019-12-18 21:21:41,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:21:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 22347 states and 89103 transitions. [2019-12-18 21:21:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:21:41,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:41,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:21:41,072 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:41,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:41,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1942943562, now seen corresponding path program 1 times [2019-12-18 21:21:41,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:41,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446890402] [2019-12-18 21:21:41,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:41,219 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 21:21:41,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446890402] [2019-12-18 21:21:41,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:41,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:21:41,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190194094] [2019-12-18 21:21:41,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:21:41,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:41,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:21:41,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:21:41,221 INFO L87 Difference]: Start difference. First operand 22347 states and 89103 transitions. Second operand 4 states. [2019-12-18 21:21:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:41,341 INFO L93 Difference]: Finished difference Result 10229 states and 34571 transitions. [2019-12-18 21:21:41,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:21:41,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:21:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:41,377 INFO L225 Difference]: With dead ends: 10229 [2019-12-18 21:21:41,377 INFO L226 Difference]: Without dead ends: 10229 [2019-12-18 21:21:41,378 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 21:21:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10229 states. [2019-12-18 21:21:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10229 to 10229. [2019-12-18 21:21:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2019-12-18 21:21:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 34571 transitions. [2019-12-18 21:21:42,127 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 34571 transitions. Word has length 16 [2019-12-18 21:21:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:42,127 INFO L462 AbstractCegarLoop]: Abstraction has 10229 states and 34571 transitions. [2019-12-18 21:21:42,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:21:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 34571 transitions. [2019-12-18 21:21:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:21:42,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:42,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:21:42,131 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1127389089, now seen corresponding path program 1 times [2019-12-18 21:21:42,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:42,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29266032] [2019-12-18 21:21:42,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:42,207 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 21:21:42,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29266032] [2019-12-18 21:21:42,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:42,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:21:42,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674545182] [2019-12-18 21:21:42,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:21:42,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:21:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:21:42,210 INFO L87 Difference]: Start difference. First operand 10229 states and 34571 transitions. Second operand 5 states. [2019-12-18 21:21:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:42,277 INFO L93 Difference]: Finished difference Result 2968 states and 9107 transitions. [2019-12-18 21:21:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:21:42,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:21:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:42,284 INFO L225 Difference]: With dead ends: 2968 [2019-12-18 21:21:42,284 INFO L226 Difference]: Without dead ends: 2968 [2019-12-18 21:21:42,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:21:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2019-12-18 21:21:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2019-12-18 21:21:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2019-12-18 21:21:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 9107 transitions. [2019-12-18 21:21:42,352 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 9107 transitions. Word has length 17 [2019-12-18 21:21:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:42,353 INFO L462 AbstractCegarLoop]: Abstraction has 2968 states and 9107 transitions. [2019-12-18 21:21:42,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:21:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 9107 transitions. [2019-12-18 21:21:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 21:21:42,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:42,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:21:42,356 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash 506293938, now seen corresponding path program 1 times [2019-12-18 21:21:42,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:42,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762756369] [2019-12-18 21:21:42,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:42,449 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 21:21:42,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762756369] [2019-12-18 21:21:42,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:42,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:21:42,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895999515] [2019-12-18 21:21:42,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:21:42,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:21:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:21:42,451 INFO L87 Difference]: Start difference. First operand 2968 states and 9107 transitions. Second operand 4 states. [2019-12-18 21:21:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:42,651 INFO L93 Difference]: Finished difference Result 3751 states and 11312 transitions. [2019-12-18 21:21:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:21:42,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 21:21:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:42,659 INFO L225 Difference]: With dead ends: 3751 [2019-12-18 21:21:42,659 INFO L226 Difference]: Without dead ends: 3751 [2019-12-18 21:21:42,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:21:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2019-12-18 21:21:42,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3583. [2019-12-18 21:21:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2019-12-18 21:21:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 10934 transitions. [2019-12-18 21:21:42,742 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 10934 transitions. Word has length 18 [2019-12-18 21:21:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:42,746 INFO L462 AbstractCegarLoop]: Abstraction has 3583 states and 10934 transitions. [2019-12-18 21:21:42,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:21:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 10934 transitions. [2019-12-18 21:21:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:21:42,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:42,755 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] [2019-12-18 21:21:42,756 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:42,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:42,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1112111079, now seen corresponding path program 1 times [2019-12-18 21:21:42,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:42,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556825573] [2019-12-18 21:21:42,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:42,867 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 21:21:42,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556825573] [2019-12-18 21:21:42,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:42,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:21:42,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140349757] [2019-12-18 21:21:42,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:21:42,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:42,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:21:42,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:21:42,870 INFO L87 Difference]: Start difference. First operand 3583 states and 10934 transitions. Second operand 4 states. [2019-12-18 21:21:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:42,914 INFO L93 Difference]: Finished difference Result 5481 states and 15973 transitions. [2019-12-18 21:21:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:21:42,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-18 21:21:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:42,923 INFO L225 Difference]: With dead ends: 5481 [2019-12-18 21:21:42,923 INFO L226 Difference]: Without dead ends: 3607 [2019-12-18 21:21:42,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:21:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-18 21:21:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3575. [2019-12-18 21:21:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3575 states. [2019-12-18 21:21:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 10798 transitions. [2019-12-18 21:21:43,020 INFO L78 Accepts]: Start accepts. Automaton has 3575 states and 10798 transitions. Word has length 32 [2019-12-18 21:21:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:43,021 INFO L462 AbstractCegarLoop]: Abstraction has 3575 states and 10798 transitions. [2019-12-18 21:21:43,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:21:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 10798 transitions. [2019-12-18 21:21:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:21:43,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:43,031 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] [2019-12-18 21:21:43,031 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1047758670, now seen corresponding path program 1 times [2019-12-18 21:21:43,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:43,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944223333] [2019-12-18 21:21:43,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:43,082 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 21:21:43,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944223333] [2019-12-18 21:21:43,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:43,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:21:43,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938943774] [2019-12-18 21:21:43,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:21:43,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:21:43,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:21:43,085 INFO L87 Difference]: Start difference. First operand 3575 states and 10798 transitions. Second operand 3 states. [2019-12-18 21:21:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:43,177 INFO L93 Difference]: Finished difference Result 5225 states and 15665 transitions. [2019-12-18 21:21:43,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:21:43,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 21:21:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:43,188 INFO L225 Difference]: With dead ends: 5225 [2019-12-18 21:21:43,188 INFO L226 Difference]: Without dead ends: 5225 [2019-12-18 21:21:43,189 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 21:21:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-18 21:21:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4249. [2019-12-18 21:21:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4249 states. [2019-12-18 21:21:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 12995 transitions. [2019-12-18 21:21:43,284 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 12995 transitions. Word has length 32 [2019-12-18 21:21:43,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:43,284 INFO L462 AbstractCegarLoop]: Abstraction has 4249 states and 12995 transitions. [2019-12-18 21:21:43,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:21:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 12995 transitions. [2019-12-18 21:21:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:21:43,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:43,294 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] [2019-12-18 21:21:43,294 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1443701580, now seen corresponding path program 1 times [2019-12-18 21:21:43,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:43,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100278179] [2019-12-18 21:21:43,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:43,332 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 21:21:43,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100278179] [2019-12-18 21:21:43,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:43,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:21:43,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102546116] [2019-12-18 21:21:43,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:21:43,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:43,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:21:43,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:21:43,334 INFO L87 Difference]: Start difference. First operand 4249 states and 12995 transitions. Second operand 3 states. [2019-12-18 21:21:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:43,388 INFO L93 Difference]: Finished difference Result 5225 states and 15251 transitions. [2019-12-18 21:21:43,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:21:43,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 21:21:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:43,397 INFO L225 Difference]: With dead ends: 5225 [2019-12-18 21:21:43,398 INFO L226 Difference]: Without dead ends: 5225 [2019-12-18 21:21:43,398 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 21:21:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-12-18 21:21:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4213. [2019-12-18 21:21:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4213 states. [2019-12-18 21:21:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 12512 transitions. [2019-12-18 21:21:43,484 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 12512 transitions. Word has length 32 [2019-12-18 21:21:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:43,484 INFO L462 AbstractCegarLoop]: Abstraction has 4213 states and 12512 transitions. [2019-12-18 21:21:43,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:21:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 12512 transitions. [2019-12-18 21:21:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 21:21:43,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:43,495 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] [2019-12-18 21:21:43,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:43,495 INFO L82 PathProgramCache]: Analyzing trace with hash 121864036, now seen corresponding path program 1 times [2019-12-18 21:21:43,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:43,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527122394] [2019-12-18 21:21:43,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:43,756 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 21:21:43,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527122394] [2019-12-18 21:21:43,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:43,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:21:43,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808730816] [2019-12-18 21:21:43,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:21:43,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:43,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:21:43,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:21:43,758 INFO L87 Difference]: Start difference. First operand 4213 states and 12512 transitions. Second operand 6 states. [2019-12-18 21:21:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:43,819 INFO L93 Difference]: Finished difference Result 3178 states and 9948 transitions. [2019-12-18 21:21:43,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:21:43,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 21:21:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:43,825 INFO L225 Difference]: With dead ends: 3178 [2019-12-18 21:21:43,826 INFO L226 Difference]: Without dead ends: 2924 [2019-12-18 21:21:43,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:21:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2019-12-18 21:21:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2744. [2019-12-18 21:21:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-12-18 21:21:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 8606 transitions. [2019-12-18 21:21:43,879 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 8606 transitions. Word has length 32 [2019-12-18 21:21:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:43,880 INFO L462 AbstractCegarLoop]: Abstraction has 2744 states and 8606 transitions. [2019-12-18 21:21:43,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:21:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 8606 transitions. [2019-12-18 21:21:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:21:43,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:43,887 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] [2019-12-18 21:21:43,887 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:43,887 INFO L82 PathProgramCache]: Analyzing trace with hash 992352402, now seen corresponding path program 1 times [2019-12-18 21:21:43,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:43,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050533779] [2019-12-18 21:21:43,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:43,955 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 21:21:43,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050533779] [2019-12-18 21:21:43,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:43,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:21:43,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593729275] [2019-12-18 21:21:43,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:21:43,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:21:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:21:43,958 INFO L87 Difference]: Start difference. First operand 2744 states and 8606 transitions. Second operand 3 states. [2019-12-18 21:21:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:43,983 INFO L93 Difference]: Finished difference Result 4096 states and 12179 transitions. [2019-12-18 21:21:43,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:21:43,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 21:21:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:43,987 INFO L225 Difference]: With dead ends: 4096 [2019-12-18 21:21:43,987 INFO L226 Difference]: Without dead ends: 1418 [2019-12-18 21:21:43,987 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 21:21:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-12-18 21:21:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1418. [2019-12-18 21:21:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-18 21:21:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3722 transitions. [2019-12-18 21:21:44,012 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3722 transitions. Word has length 47 [2019-12-18 21:21:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:44,012 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 3722 transitions. [2019-12-18 21:21:44,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:21:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3722 transitions. [2019-12-18 21:21:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:21:44,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:44,016 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] [2019-12-18 21:21:44,016 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2081953324, now seen corresponding path program 2 times [2019-12-18 21:21:44,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:44,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018963266] [2019-12-18 21:21:44,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:44,108 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 21:21:44,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018963266] [2019-12-18 21:21:44,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:44,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:21:44,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496172600] [2019-12-18 21:21:44,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:21:44,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:44,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:21:44,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:21:44,110 INFO L87 Difference]: Start difference. First operand 1418 states and 3722 transitions. Second operand 7 states. [2019-12-18 21:21:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:44,402 INFO L93 Difference]: Finished difference Result 3765 states and 9849 transitions. [2019-12-18 21:21:44,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:21:44,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 21:21:44,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:44,406 INFO L225 Difference]: With dead ends: 3765 [2019-12-18 21:21:44,406 INFO L226 Difference]: Without dead ends: 2471 [2019-12-18 21:21:44,407 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 21:21:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-12-18 21:21:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 1595. [2019-12-18 21:21:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-18 21:21:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 4164 transitions. [2019-12-18 21:21:44,439 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 4164 transitions. Word has length 47 [2019-12-18 21:21:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:44,440 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 4164 transitions. [2019-12-18 21:21:44,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:21:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 4164 transitions. [2019-12-18 21:21:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:21:44,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:44,444 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] [2019-12-18 21:21:44,445 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:44,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1032275112, now seen corresponding path program 3 times [2019-12-18 21:21:44,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:44,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541750635] [2019-12-18 21:21:44,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:44,663 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 21:21:44,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541750635] [2019-12-18 21:21:44,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:44,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:21:44,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481582049] [2019-12-18 21:21:44,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:21:44,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:21:44,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:21:44,665 INFO L87 Difference]: Start difference. First operand 1595 states and 4164 transitions. Second operand 9 states. [2019-12-18 21:21:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:46,066 INFO L93 Difference]: Finished difference Result 2819 states and 7017 transitions. [2019-12-18 21:21:46,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:21:46,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-18 21:21:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:46,072 INFO L225 Difference]: With dead ends: 2819 [2019-12-18 21:21:46,072 INFO L226 Difference]: Without dead ends: 2783 [2019-12-18 21:21:46,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:21:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2019-12-18 21:21:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 1679. [2019-12-18 21:21:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2019-12-18 21:21:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 4227 transitions. [2019-12-18 21:21:46,513 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 4227 transitions. Word has length 47 [2019-12-18 21:21:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:46,513 INFO L462 AbstractCegarLoop]: Abstraction has 1679 states and 4227 transitions. [2019-12-18 21:21:46,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:21:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 4227 transitions. [2019-12-18 21:21:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:21:46,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:46,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:21:46,518 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:46,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:46,518 INFO L82 PathProgramCache]: Analyzing trace with hash 650117112, now seen corresponding path program 4 times [2019-12-18 21:21:46,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:46,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064458224] [2019-12-18 21:21:46,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:46,625 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 21:21:46,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064458224] [2019-12-18 21:21:46,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:46,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:21:46,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448614826] [2019-12-18 21:21:46,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:21:46,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:46,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:21:46,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:21:46,627 INFO L87 Difference]: Start difference. First operand 1679 states and 4227 transitions. Second operand 7 states. [2019-12-18 21:21:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:47,566 INFO L93 Difference]: Finished difference Result 2974 states and 7409 transitions. [2019-12-18 21:21:47,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:21:47,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 21:21:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:47,572 INFO L225 Difference]: With dead ends: 2974 [2019-12-18 21:21:47,572 INFO L226 Difference]: Without dead ends: 2974 [2019-12-18 21:21:47,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:21:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2019-12-18 21:21:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1761. [2019-12-18 21:21:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-12-18 21:21:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 4470 transitions. [2019-12-18 21:21:47,616 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 4470 transitions. Word has length 47 [2019-12-18 21:21:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:47,616 INFO L462 AbstractCegarLoop]: Abstraction has 1761 states and 4470 transitions. [2019-12-18 21:21:47,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:21:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 4470 transitions. [2019-12-18 21:21:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 21:21:47,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:47,621 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] [2019-12-18 21:21:47,621 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash 88691356, now seen corresponding path program 5 times [2019-12-18 21:21:47,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:47,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821926231] [2019-12-18 21:21:47,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:21:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:21:47,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821926231] [2019-12-18 21:21:47,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:21:47,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:21:47,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572657815] [2019-12-18 21:21:47,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:21:47,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:21:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:21:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:21:47,734 INFO L87 Difference]: Start difference. First operand 1761 states and 4470 transitions. Second operand 3 states. [2019-12-18 21:21:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:21:47,752 INFO L93 Difference]: Finished difference Result 1759 states and 4465 transitions. [2019-12-18 21:21:47,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:21:47,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 21:21:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:21:47,755 INFO L225 Difference]: With dead ends: 1759 [2019-12-18 21:21:47,756 INFO L226 Difference]: Without dead ends: 1759 [2019-12-18 21:21:47,756 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 21:21:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-12-18 21:21:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1463. [2019-12-18 21:21:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2019-12-18 21:21:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 3731 transitions. [2019-12-18 21:21:47,781 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 3731 transitions. Word has length 47 [2019-12-18 21:21:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:21:47,782 INFO L462 AbstractCegarLoop]: Abstraction has 1463 states and 3731 transitions. [2019-12-18 21:21:47,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:21:47,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 3731 transitions. [2019-12-18 21:21:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:21:47,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:21:47,786 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] [2019-12-18 21:21:47,786 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:21:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:21:47,787 INFO L82 PathProgramCache]: Analyzing trace with hash 378110637, now seen corresponding path program 1 times [2019-12-18 21:21:47,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:21:47,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274099353] [2019-12-18 21:21:47,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:21:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:21:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:21:47,950 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:21:47,951 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:21:47,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a~0_9) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~y~0_18 0) (= 0 v_~z$r_buff1_thd1~0_10) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~weak$$choice0~0_9) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd3~0_63 0) (= v_~z$mem_tmp~0_11 0) (= |v_ULTIMATE.start_main_~#t1077~0.offset_22| 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_21 0) (= v_~b~0_11 0) (= 0 v_~z$w_buff1~0_22) (= 0 v_~__unbuffered_p3_EAX~0_17) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd4~0_26 0) (= 0 v_~__unbuffered_p2_EAX~0_17) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$r_buff1_thd2~0_10) (= v_~z~0_23 0) (= v_~z$w_buff0_used~0_91 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$read_delayed~0_7 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_28| 1)) (= 0 v_~z$r_buff1_thd4~0_17) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_4| 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z$w_buff0~0_25) (= (select .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_28|) 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1077~0.base_28| 4)) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t1077~0.base_28| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t1077~0.base_28|) |v_ULTIMATE.start_main_~#t1077~0.offset_22| 0)) |v_#memory_int_29|) (= 0 v_~z$w_buff1_used~0_57) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1077~0.base_28|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_27|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_21|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_17, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_20|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_17, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_10|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1077~0.offset=|v_ULTIMATE.start_main_~#t1077~0.offset_22|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_27|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ~y~0=v_~y~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_17|, ULTIMATE.start_main_~#t1077~0.base=|v_ULTIMATE.start_main_~#t1077~0.base_28|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1078~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1079~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1080~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t1077~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1079~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1078~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, ULTIMATE.start_main_~#t1077~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:21:47,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1078~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1078~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1078~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1078~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13|) |v_ULTIMATE.start_main_~#t1078~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1078~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1078~0.base] because there is no mapped edge [2019-12-18 21:21:47,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1079~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1079~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1079~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13|) |v_ULTIMATE.start_main_~#t1079~0.offset_11| 2)) |v_#memory_int_19|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1079~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1079~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 21:21:47,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1080~0.base_11| 4) |v_#length_19|) (= 0 |v_ULTIMATE.start_main_~#t1080~0.offset_10|) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11| 1) |v_#valid_42|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1080~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11|) |v_ULTIMATE.start_main_~#t1080~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1080~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, #length, ULTIMATE.start_main_~#t1080~0.base] because there is no mapped edge [2019-12-18 21:21:47,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= (mod v_~z$w_buff1_used~0_38 256) 0) (= v_P3Thread1of1ForFork1_~arg.base_4 |v_P3Thread1of1ForFork1_#in~arg.base_4|) (= v_~z$w_buff0_used~0_61 v_~z$w_buff1_used~0_38) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6) (= v_~z$w_buff0_used~0_60 1) (= v_~z$w_buff0~0_14 v_~z$w_buff1~0_12) (= |v_P3Thread1of1ForFork1_#in~arg.offset_4| v_P3Thread1of1ForFork1_~arg.offset_4) (= 1 v_~z$w_buff0~0_13)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_61, ~z$w_buff0~0=v_~z$w_buff0~0_14, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_4|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_4|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_60, ~z$w_buff0~0=v_~z$w_buff0~0_13, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_4|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_38, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, ~z$w_buff1~0=v_~z$w_buff1~0_12, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_4, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_4|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:21:47,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~x~0_7) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= 1 v_~b~0_6)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~b~0=v_~b~0_6, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 21:21:47,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 2 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= 1 v_~y~0_8) (= v_P1Thread1of1ForFork3_~arg.offset_4 |v_P1Thread1of1ForFork3_#in~arg.offset_4|) (= v_P1Thread1of1ForFork3_~arg.base_4 |v_P1Thread1of1ForFork3_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_4, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_4|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_4, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_4|, ~y~0=v_~y~0_8, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-18 21:21:47,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L776-->L776-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-915063702 256)))) (or (and (= ~z$w_buff0~0_In-915063702 |P2Thread1of1ForFork0_#t~ite9_Out-915063702|) (= |P2Thread1of1ForFork0_#t~ite8_In-915063702| |P2Thread1of1ForFork0_#t~ite8_Out-915063702|) (not .cse0)) (and (= ~z$w_buff0~0_In-915063702 |P2Thread1of1ForFork0_#t~ite8_Out-915063702|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-915063702 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-915063702 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-915063702 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-915063702 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite8_Out-915063702| |P2Thread1of1ForFork0_#t~ite9_Out-915063702|)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-915063702|, ~z$w_buff0~0=~z$w_buff0~0_In-915063702, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-915063702, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-915063702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-915063702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-915063702, ~weak$$choice2~0=~weak$$choice2~0_In-915063702} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-915063702|, ~z$w_buff0~0=~z$w_buff0~0_In-915063702, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-915063702, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-915063702, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-915063702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-915063702, ~weak$$choice2~0=~weak$$choice2~0_In-915063702, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-915063702|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 21:21:47,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1336357110 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1336357110 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1336357110 256)) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1336357110 256)) .cse0) (= (mod ~z$w_buff0_used~0_In-1336357110 256) 0))) (= ~z$w_buff1~0_In-1336357110 |P2Thread1of1ForFork0_#t~ite11_Out-1336357110|) .cse1 (= |P2Thread1of1ForFork0_#t~ite12_Out-1336357110| |P2Thread1of1ForFork0_#t~ite11_Out-1336357110|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_In-1336357110| |P2Thread1of1ForFork0_#t~ite11_Out-1336357110|) (= ~z$w_buff1~0_In-1336357110 |P2Thread1of1ForFork0_#t~ite12_Out-1336357110|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1336357110, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In-1336357110|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1336357110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1336357110, ~z$w_buff1~0=~z$w_buff1~0_In-1336357110, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1336357110, ~weak$$choice2~0=~weak$$choice2~0_In-1336357110} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1336357110|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1336357110, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1336357110|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1336357110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1336357110, ~z$w_buff1~0=~z$w_buff1~0_In-1336357110, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1336357110, ~weak$$choice2~0=~weak$$choice2~0_In-1336357110} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:21:47,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L778-->L778-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2141626544 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite15_Out-2141626544| |P2Thread1of1ForFork0_#t~ite14_Out-2141626544|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2141626544 256) 0))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-2141626544 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In-2141626544 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-2141626544 256)))) .cse1 (= ~z$w_buff0_used~0_In-2141626544 |P2Thread1of1ForFork0_#t~ite14_Out-2141626544|)) (and (= |P2Thread1of1ForFork0_#t~ite15_Out-2141626544| ~z$w_buff0_used~0_In-2141626544) (= |P2Thread1of1ForFork0_#t~ite14_In-2141626544| |P2Thread1of1ForFork0_#t~ite14_Out-2141626544|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In-2141626544|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141626544, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2141626544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2141626544, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2141626544, ~weak$$choice2~0=~weak$$choice2~0_In-2141626544} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2141626544|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out-2141626544|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2141626544, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2141626544, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2141626544, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2141626544, ~weak$$choice2~0=~weak$$choice2~0_In-2141626544} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-18 21:21:47,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (= v_~z$r_buff0_thd3~0_43 v_~z$r_buff0_thd3~0_42) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 21:21:47,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In47034625 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In47034625 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite28_Out47034625| ~z$w_buff0_used~0_In47034625)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork1_#t~ite28_Out47034625| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In47034625, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In47034625} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In47034625, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out47034625|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In47034625} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:21:47,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_12 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:21:47,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In569892158 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In569892158 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In569892158 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In569892158 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite29_Out569892158| 0)) (and (= ~z$w_buff1_used~0_In569892158 |P3Thread1of1ForFork1_#t~ite29_Out569892158|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In569892158, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569892158, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In569892158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569892158} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In569892158, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out569892158|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569892158, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In569892158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569892158} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 21:21:47,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1435907475 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1435907475 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-1435907475)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-1435907475 ~z$r_buff0_thd4~0_Out-1435907475)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1435907475, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1435907475} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1435907475, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1435907475, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1435907475|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 21:21:47,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In423795215 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In423795215 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In423795215 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In423795215 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite31_Out423795215| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite31_Out423795215| ~z$r_buff1_thd4~0_In423795215)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In423795215, ~z$w_buff0_used~0=~z$w_buff0_used~0_In423795215, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In423795215, ~z$w_buff1_used~0=~z$w_buff1_used~0_In423795215} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In423795215, ~z$w_buff0_used~0=~z$w_buff0_used~0_In423795215, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In423795215, ~z$w_buff1_used~0=~z$w_buff1_used~0_In423795215, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out423795215|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:21:47,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd4~0_12 |v_P3Thread1of1ForFork1_#t~ite31_8|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_8|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:21:47,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:21:47,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In242362671 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In242362671 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In242362671 |ULTIMATE.start_main_#t~ite36_Out242362671|)) (and (not .cse1) (= ~z$w_buff1~0_In242362671 |ULTIMATE.start_main_#t~ite36_Out242362671|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In242362671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In242362671, ~z$w_buff1~0=~z$w_buff1~0_In242362671, ~z~0=~z~0_In242362671} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In242362671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In242362671, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out242362671|, ~z$w_buff1~0=~z$w_buff1~0_In242362671, ~z~0=~z~0_In242362671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:21:47,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_14 |v_ULTIMATE.start_main_#t~ite36_8|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_8|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-18 21:21:47,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In143143948 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In143143948 256) 0))) (or (and (= ~z$w_buff0_used~0_In143143948 |ULTIMATE.start_main_#t~ite38_Out143143948|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out143143948| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In143143948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In143143948} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In143143948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In143143948, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out143143948|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:21:47,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In129393067 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In129393067 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In129393067 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In129393067 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out129393067| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In129393067 |ULTIMATE.start_main_#t~ite39_Out129393067|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In129393067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In129393067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In129393067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In129393067} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In129393067, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out129393067|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In129393067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In129393067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In129393067} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:21:47,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1042039563 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1042039563 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1042039563| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1042039563| ~z$r_buff0_thd0~0_In1042039563) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1042039563, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1042039563} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1042039563, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1042039563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1042039563} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:21:47,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In719275335 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In719275335 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In719275335 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In719275335 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out719275335|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In719275335 |ULTIMATE.start_main_#t~ite41_Out719275335|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In719275335, ~z$w_buff0_used~0=~z$w_buff0_used~0_In719275335, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In719275335, ~z$w_buff1_used~0=~z$w_buff1_used~0_In719275335} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out719275335|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In719275335, ~z$w_buff0_used~0=~z$w_buff0_used~0_In719275335, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In719275335, ~z$w_buff1_used~0=~z$w_buff1_used~0_In719275335} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 21:21:47,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= v_~main$tmp_guard1~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~x~0_10 2) (= v_~y~0_10 2) (= 1 v_~__unbuffered_p3_EAX~0_9) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= |v_ULTIMATE.start_main_#t~ite41_13| v_~z$r_buff1_thd0~0_14) (= 0 v_~__unbuffered_p3_EBX~0_8)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:21:48,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:21:48 BasicIcfg [2019-12-18 21:21:48,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:21:48,082 INFO L168 Benchmark]: Toolchain (without parser) took 22122.24 ms. Allocated memory was 143.1 MB in the beginning and 935.9 MB in the end (delta: 792.7 MB). Free memory was 99.2 MB in the beginning and 600.1 MB in the end (delta: -500.9 MB). Peak memory consumption was 291.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:21:48,082 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 21:21:48,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.09 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.8 MB in the beginning and 154.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:21:48,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.66 ms. Allocated memory is still 200.3 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:21:48,084 INFO L168 Benchmark]: Boogie Preprocessor took 57.36 ms. Allocated memory is still 200.3 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:21:48,085 INFO L168 Benchmark]: RCFGBuilder took 781.99 ms. Allocated memory is still 200.3 MB. Free memory was 148.8 MB in the beginning and 103.0 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:21:48,086 INFO L168 Benchmark]: TraceAbstraction took 20447.30 ms. Allocated memory was 200.3 MB in the beginning and 935.9 MB in the end (delta: 735.6 MB). Free memory was 102.3 MB in the beginning and 600.1 MB in the end (delta: -497.8 MB). Peak memory consumption was 237.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:21:48,090 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.55 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.09 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.8 MB in the beginning and 154.3 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.66 ms. Allocated memory is still 200.3 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.36 ms. Allocated memory is still 200.3 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.99 ms. Allocated memory is still 200.3 MB. Free memory was 148.8 MB in the beginning and 103.0 MB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20447.30 ms. Allocated memory was 200.3 MB in the beginning and 935.9 MB in the end (delta: 735.6 MB). Free memory was 102.3 MB in the beginning and 600.1 MB in the end (delta: -497.8 MB). Peak memory consumption was 237.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 169 ProgramPointsBefore, 82 ProgramPointsAfterwards, 191 TransitionsBefore, 88 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 21 ChoiceCompositions, 5425 VarBasedMoverChecksPositive, 133 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50510 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1077, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L843] FCALL, FORK 0 pthread_create(&t1078, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L845] FCALL, FORK 0 pthread_create(&t1079, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L847] FCALL, FORK 0 pthread_create(&t1080, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 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 [L856] 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 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1832 SDtfs, 2087 SDslu, 3742 SDs, 0 SdLazy, 1967 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30990occurred 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: 5.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 5857 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 50737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...