/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/mix012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:24:00,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:24:00,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:24:00,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:24:00,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:24:00,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:24:00,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:24:00,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:24:00,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:24:00,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:24:00,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:24:00,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:24:00,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:24:00,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:24:00,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:24:00,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:24:00,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:24:00,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:24:00,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:24:00,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:24:00,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:24:00,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:24:00,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:24:00,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:24:00,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:24:00,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:24:00,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:24:00,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:24:00,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:24:00,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:24:00,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:24:00,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:24:00,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:24:00,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:24:00,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:24:00,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:24:00,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:24:00,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:24:00,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:24:00,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:24:00,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:24:00,633 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-27 05:24:00,648 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:24:00,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:24:00,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:24:00,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:24:00,650 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:24:00,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:24:00,650 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:24:00,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:24:00,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:24:00,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:24:00,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:24:00,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:24:00,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:24:00,652 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:24:00,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:24:00,652 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:24:00,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:24:00,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:24:00,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:24:00,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:24:00,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:24:00,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:24:00,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:24:00,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:24:00,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:24:00,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:24:00,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:24:00,654 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:24:00,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:24:00,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:24:00,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:24:00,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:24:00,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:24:00,982 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:24:00,982 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:24:00,984 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-27 05:24:01,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cda09d4/491c22c2418849dfb8d312d3db733ffd/FLAGe707044cc [2019-12-27 05:24:01,671 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:24:01,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-27 05:24:01,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cda09d4/491c22c2418849dfb8d312d3db733ffd/FLAGe707044cc [2019-12-27 05:24:01,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cda09d4/491c22c2418849dfb8d312d3db733ffd [2019-12-27 05:24:01,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:24:01,965 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:24:01,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:24:01,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:24:01,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:24:01,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:24:01" (1/1) ... [2019-12-27 05:24:01,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:01, skipping insertion in model container [2019-12-27 05:24:01,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:24:01" (1/1) ... [2019-12-27 05:24:01,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:24:02,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:24:02,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:24:02,637 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:24:02,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:24:02,790 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:24:02,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02 WrapperNode [2019-12-27 05:24:02,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:24:02,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:24:02,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:24:02,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:24:02,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (1/1) ... [2019-12-27 05:24:02,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (1/1) ... [2019-12-27 05:24:02,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:24:02,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:24:02,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:24:02,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:24:02,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (1/1) ... [2019-12-27 05:24:02,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (1/1) ... [2019-12-27 05:24:02,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (1/1) ... [2019-12-27 05:24:02,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (1/1) ... [2019-12-27 05:24:02,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (1/1) ... [2019-12-27 05:24:02,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (1/1) ... [2019-12-27 05:24:02,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (1/1) ... [2019-12-27 05:24:02,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:24:02,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:24:02,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:24:02,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:24:02,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (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-27 05:24:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:24:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:24:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:24:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:24:02,980 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:24:02,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:24:02,981 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:24:02,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:24:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:24:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:24:02,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:24:02,986 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:24:04,016 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:24:04,017 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:24:04,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:24:04 BoogieIcfgContainer [2019-12-27 05:24:04,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:24:04,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:24:04,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:24:04,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:24:04,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:24:01" (1/3) ... [2019-12-27 05:24:04,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115b2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:24:04, skipping insertion in model container [2019-12-27 05:24:04,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:24:02" (2/3) ... [2019-12-27 05:24:04,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115b2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:24:04, skipping insertion in model container [2019-12-27 05:24:04,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:24:04" (3/3) ... [2019-12-27 05:24:04,028 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt.i [2019-12-27 05:24:04,038 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:24:04,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:24:04,046 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:24:04,047 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:24:04,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,101 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,143 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,144 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,144 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,144 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,184 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:24:04,201 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 05:24:04,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:24:04,224 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:24:04,224 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:24:04,224 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:24:04,224 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:24:04,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:24:04,224 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:24:04,225 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:24:04,242 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-27 05:24:04,244 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 05:24:04,358 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 05:24:04,358 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:24:04,380 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 05:24:04,418 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 05:24:04,489 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 05:24:04,489 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:24:04,502 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 05:24:04,534 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 05:24:04,535 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:24:04,891 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-27 05:24:07,635 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 05:24:07,738 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 05:24:08,066 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 05:24:08,187 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 05:24:08,244 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131854 [2019-12-27 05:24:08,244 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 05:24:08,248 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 132 transitions [2019-12-27 05:24:09,958 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26534 states. [2019-12-27 05:24:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 26534 states. [2019-12-27 05:24:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 05:24:09,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:09,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 05:24:09,966 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:09,972 INFO L82 PathProgramCache]: Analyzing trace with hash 953057354, now seen corresponding path program 1 times [2019-12-27 05:24:09,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:09,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133172398] [2019-12-27 05:24:09,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:10,234 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-27 05:24:10,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133172398] [2019-12-27 05:24:10,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:10,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:24:10,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100385470] [2019-12-27 05:24:10,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:10,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:10,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:10,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:10,255 INFO L87 Difference]: Start difference. First operand 26534 states. Second operand 3 states. [2019-12-27 05:24:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:10,994 INFO L93 Difference]: Finished difference Result 26194 states and 94183 transitions. [2019-12-27 05:24:10,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:10,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 05:24:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:11,246 INFO L225 Difference]: With dead ends: 26194 [2019-12-27 05:24:11,248 INFO L226 Difference]: Without dead ends: 24502 [2019-12-27 05:24:11,249 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-27 05:24:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24502 states. [2019-12-27 05:24:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24502 to 24502. [2019-12-27 05:24:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24502 states. [2019-12-27 05:24:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24502 states to 24502 states and 88039 transitions. [2019-12-27 05:24:13,575 INFO L78 Accepts]: Start accepts. Automaton has 24502 states and 88039 transitions. Word has length 5 [2019-12-27 05:24:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:13,576 INFO L462 AbstractCegarLoop]: Abstraction has 24502 states and 88039 transitions. [2019-12-27 05:24:13,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 24502 states and 88039 transitions. [2019-12-27 05:24:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:24:13,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:13,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:13,583 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:13,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:13,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1380440387, now seen corresponding path program 1 times [2019-12-27 05:24:13,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:13,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732629867] [2019-12-27 05:24:13,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:13,752 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-27 05:24:13,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732629867] [2019-12-27 05:24:13,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:13,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:24:13,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372243534] [2019-12-27 05:24:13,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:13,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:13,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:13,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:13,758 INFO L87 Difference]: Start difference. First operand 24502 states and 88039 transitions. Second operand 4 states. [2019-12-27 05:24:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:14,395 INFO L93 Difference]: Finished difference Result 37826 states and 129915 transitions. [2019-12-27 05:24:14,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:24:14,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:24:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:15,749 INFO L225 Difference]: With dead ends: 37826 [2019-12-27 05:24:15,749 INFO L226 Difference]: Without dead ends: 37810 [2019-12-27 05:24:15,750 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-27 05:24:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37810 states. [2019-12-27 05:24:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37810 to 36886. [2019-12-27 05:24:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36886 states. [2019-12-27 05:24:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36886 states to 36886 states and 127503 transitions. [2019-12-27 05:24:17,233 INFO L78 Accepts]: Start accepts. Automaton has 36886 states and 127503 transitions. Word has length 11 [2019-12-27 05:24:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:17,233 INFO L462 AbstractCegarLoop]: Abstraction has 36886 states and 127503 transitions. [2019-12-27 05:24:17,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 36886 states and 127503 transitions. [2019-12-27 05:24:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:24:17,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:17,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:17,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:17,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2090130903, now seen corresponding path program 1 times [2019-12-27 05:24:17,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:17,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245828821] [2019-12-27 05:24:17,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:17,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245828821] [2019-12-27 05:24:17,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:17,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:24:17,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994565405] [2019-12-27 05:24:17,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:17,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:17,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:17,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:17,318 INFO L87 Difference]: Start difference. First operand 36886 states and 127503 transitions. Second operand 4 states. [2019-12-27 05:24:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:17,995 INFO L93 Difference]: Finished difference Result 46955 states and 159667 transitions. [2019-12-27 05:24:17,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:24:17,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:24:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:18,257 INFO L225 Difference]: With dead ends: 46955 [2019-12-27 05:24:18,258 INFO L226 Difference]: Without dead ends: 46941 [2019-12-27 05:24:18,258 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-27 05:24:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46941 states. [2019-12-27 05:24:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46941 to 42372. [2019-12-27 05:24:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42372 states. [2019-12-27 05:24:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42372 states to 42372 states and 145521 transitions. [2019-12-27 05:24:21,916 INFO L78 Accepts]: Start accepts. Automaton has 42372 states and 145521 transitions. Word has length 14 [2019-12-27 05:24:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:21,917 INFO L462 AbstractCegarLoop]: Abstraction has 42372 states and 145521 transitions. [2019-12-27 05:24:21,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 42372 states and 145521 transitions. [2019-12-27 05:24:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 05:24:21,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:21,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:21,923 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:21,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:21,923 INFO L82 PathProgramCache]: Analyzing trace with hash -369520138, now seen corresponding path program 1 times [2019-12-27 05:24:21,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:21,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102171863] [2019-12-27 05:24:21,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:21,967 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-27 05:24:21,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102171863] [2019-12-27 05:24:21,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:21,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:21,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327802102] [2019-12-27 05:24:21,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:21,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:21,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:21,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:21,972 INFO L87 Difference]: Start difference. First operand 42372 states and 145521 transitions. Second operand 3 states. [2019-12-27 05:24:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:22,302 INFO L93 Difference]: Finished difference Result 70468 states and 231072 transitions. [2019-12-27 05:24:22,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:22,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 05:24:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:22,474 INFO L225 Difference]: With dead ends: 70468 [2019-12-27 05:24:22,475 INFO L226 Difference]: Without dead ends: 70468 [2019-12-27 05:24:22,475 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-27 05:24:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70468 states. [2019-12-27 05:24:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70468 to 62872. [2019-12-27 05:24:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62872 states. [2019-12-27 05:24:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62872 states to 62872 states and 209460 transitions. [2019-12-27 05:24:24,376 INFO L78 Accepts]: Start accepts. Automaton has 62872 states and 209460 transitions. Word has length 15 [2019-12-27 05:24:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:24,376 INFO L462 AbstractCegarLoop]: Abstraction has 62872 states and 209460 transitions. [2019-12-27 05:24:24,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 62872 states and 209460 transitions. [2019-12-27 05:24:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:24:24,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:24,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:24,382 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:24,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1639009254, now seen corresponding path program 1 times [2019-12-27 05:24:24,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:24,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819472886] [2019-12-27 05:24:24,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:24,427 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-27 05:24:24,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819472886] [2019-12-27 05:24:24,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:24,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:24:24,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569096679] [2019-12-27 05:24:24,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:24,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:24,429 INFO L87 Difference]: Start difference. First operand 62872 states and 209460 transitions. Second operand 3 states. [2019-12-27 05:24:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:25,076 INFO L93 Difference]: Finished difference Result 59416 states and 197713 transitions. [2019-12-27 05:24:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:25,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 05:24:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:25,191 INFO L225 Difference]: With dead ends: 59416 [2019-12-27 05:24:25,191 INFO L226 Difference]: Without dead ends: 59093 [2019-12-27 05:24:25,192 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-27 05:24:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59093 states. [2019-12-27 05:24:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59093 to 59093. [2019-12-27 05:24:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59093 states. [2019-12-27 05:24:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59093 states to 59093 states and 196717 transitions. [2019-12-27 05:24:28,380 INFO L78 Accepts]: Start accepts. Automaton has 59093 states and 196717 transitions. Word has length 16 [2019-12-27 05:24:28,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:28,380 INFO L462 AbstractCegarLoop]: Abstraction has 59093 states and 196717 transitions. [2019-12-27 05:24:28,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 59093 states and 196717 transitions. [2019-12-27 05:24:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 05:24:28,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:28,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:28,388 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2035304780, now seen corresponding path program 1 times [2019-12-27 05:24:28,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:28,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598917366] [2019-12-27 05:24:28,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:28,442 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-27 05:24:28,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598917366] [2019-12-27 05:24:28,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:28,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:24:28,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255315267] [2019-12-27 05:24:28,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:28,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:28,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:28,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:28,444 INFO L87 Difference]: Start difference. First operand 59093 states and 196717 transitions. Second operand 4 states. [2019-12-27 05:24:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:29,407 INFO L93 Difference]: Finished difference Result 72866 states and 238915 transitions. [2019-12-27 05:24:29,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:24:29,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 05:24:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:29,576 INFO L225 Difference]: With dead ends: 72866 [2019-12-27 05:24:29,576 INFO L226 Difference]: Without dead ends: 72849 [2019-12-27 05:24:29,576 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-27 05:24:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72849 states. [2019-12-27 05:24:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72849 to 59871. [2019-12-27 05:24:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59871 states. [2019-12-27 05:24:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59871 states to 59871 states and 199251 transitions. [2019-12-27 05:24:33,049 INFO L78 Accepts]: Start accepts. Automaton has 59871 states and 199251 transitions. Word has length 17 [2019-12-27 05:24:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:33,050 INFO L462 AbstractCegarLoop]: Abstraction has 59871 states and 199251 transitions. [2019-12-27 05:24:33,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 59871 states and 199251 transitions. [2019-12-27 05:24:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 05:24:33,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:33,063 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] [2019-12-27 05:24:33,063 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:33,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash -610432844, now seen corresponding path program 1 times [2019-12-27 05:24:33,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:33,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317636383] [2019-12-27 05:24:33,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:33,131 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-27 05:24:33,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317636383] [2019-12-27 05:24:33,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:33,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:33,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896786865] [2019-12-27 05:24:33,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:33,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:33,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:33,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:33,133 INFO L87 Difference]: Start difference. First operand 59871 states and 199251 transitions. Second operand 5 states. [2019-12-27 05:24:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:34,061 INFO L93 Difference]: Finished difference Result 84003 states and 272461 transitions. [2019-12-27 05:24:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:24:34,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 05:24:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:34,230 INFO L225 Difference]: With dead ends: 84003 [2019-12-27 05:24:34,230 INFO L226 Difference]: Without dead ends: 83989 [2019-12-27 05:24:34,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:24:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83989 states. [2019-12-27 05:24:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83989 to 65331. [2019-12-27 05:24:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65331 states. [2019-12-27 05:24:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65331 states to 65331 states and 216301 transitions. [2019-12-27 05:24:38,813 INFO L78 Accepts]: Start accepts. Automaton has 65331 states and 216301 transitions. Word has length 20 [2019-12-27 05:24:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:38,814 INFO L462 AbstractCegarLoop]: Abstraction has 65331 states and 216301 transitions. [2019-12-27 05:24:38,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 65331 states and 216301 transitions. [2019-12-27 05:24:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 05:24:38,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:38,832 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] [2019-12-27 05:24:38,832 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:38,833 INFO L82 PathProgramCache]: Analyzing trace with hash -217091173, now seen corresponding path program 1 times [2019-12-27 05:24:38,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:38,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716109311] [2019-12-27 05:24:38,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:38,909 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-27 05:24:38,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716109311] [2019-12-27 05:24:38,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:38,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:38,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292268829] [2019-12-27 05:24:38,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:38,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:38,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:38,912 INFO L87 Difference]: Start difference. First operand 65331 states and 216301 transitions. Second operand 4 states. [2019-12-27 05:24:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:38,976 INFO L93 Difference]: Finished difference Result 11962 states and 32112 transitions. [2019-12-27 05:24:38,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:24:38,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 05:24:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:38,985 INFO L225 Difference]: With dead ends: 11962 [2019-12-27 05:24:38,985 INFO L226 Difference]: Without dead ends: 7410 [2019-12-27 05:24:38,986 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-27 05:24:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7410 states. [2019-12-27 05:24:39,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7410 to 7362. [2019-12-27 05:24:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7362 states. [2019-12-27 05:24:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7362 states to 7362 states and 17120 transitions. [2019-12-27 05:24:39,064 INFO L78 Accepts]: Start accepts. Automaton has 7362 states and 17120 transitions. Word has length 23 [2019-12-27 05:24:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:39,064 INFO L462 AbstractCegarLoop]: Abstraction has 7362 states and 17120 transitions. [2019-12-27 05:24:39,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 7362 states and 17120 transitions. [2019-12-27 05:24:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 05:24:39,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:39,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:39,069 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:39,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1288158756, now seen corresponding path program 1 times [2019-12-27 05:24:39,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:39,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198867482] [2019-12-27 05:24:39,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:39,118 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-27 05:24:39,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198867482] [2019-12-27 05:24:39,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:39,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:39,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306493607] [2019-12-27 05:24:39,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:39,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:39,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:39,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:39,121 INFO L87 Difference]: Start difference. First operand 7362 states and 17120 transitions. Second operand 3 states. [2019-12-27 05:24:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:39,202 INFO L93 Difference]: Finished difference Result 8021 states and 17640 transitions. [2019-12-27 05:24:39,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:39,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 05:24:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:39,210 INFO L225 Difference]: With dead ends: 8021 [2019-12-27 05:24:39,210 INFO L226 Difference]: Without dead ends: 8021 [2019-12-27 05:24:39,210 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-27 05:24:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8021 states. [2019-12-27 05:24:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8021 to 7419. [2019-12-27 05:24:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7419 states. [2019-12-27 05:24:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7419 states to 7419 states and 16391 transitions. [2019-12-27 05:24:39,291 INFO L78 Accepts]: Start accepts. Automaton has 7419 states and 16391 transitions. Word has length 31 [2019-12-27 05:24:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:39,291 INFO L462 AbstractCegarLoop]: Abstraction has 7419 states and 16391 transitions. [2019-12-27 05:24:39,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7419 states and 16391 transitions. [2019-12-27 05:24:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:24:39,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:39,298 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] [2019-12-27 05:24:39,298 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1169223524, now seen corresponding path program 1 times [2019-12-27 05:24:39,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:39,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518544182] [2019-12-27 05:24:39,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:24:39,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518544182] [2019-12-27 05:24:39,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:39,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:39,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692382343] [2019-12-27 05:24:39,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:39,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:39,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:39,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:39,416 INFO L87 Difference]: Start difference. First operand 7419 states and 16391 transitions. Second operand 5 states. [2019-12-27 05:24:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:39,828 INFO L93 Difference]: Finished difference Result 8342 states and 18150 transitions. [2019-12-27 05:24:39,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:24:39,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 05:24:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:39,842 INFO L225 Difference]: With dead ends: 8342 [2019-12-27 05:24:39,843 INFO L226 Difference]: Without dead ends: 8341 [2019-12-27 05:24:39,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:24:39,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8341 states. [2019-12-27 05:24:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8341 to 6561. [2019-12-27 05:24:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6561 states. [2019-12-27 05:24:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 14656 transitions. [2019-12-27 05:24:39,918 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 14656 transitions. Word has length 34 [2019-12-27 05:24:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:39,918 INFO L462 AbstractCegarLoop]: Abstraction has 6561 states and 14656 transitions. [2019-12-27 05:24:39,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 14656 transitions. [2019-12-27 05:24:39,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:24:39,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:39,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:39,926 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:39,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:39,926 INFO L82 PathProgramCache]: Analyzing trace with hash -199933436, now seen corresponding path program 1 times [2019-12-27 05:24:39,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:39,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841274713] [2019-12-27 05:24:39,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:39,995 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-27 05:24:39,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841274713] [2019-12-27 05:24:39,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:39,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:39,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736152264] [2019-12-27 05:24:39,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:39,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:39,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:39,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:39,997 INFO L87 Difference]: Start difference. First operand 6561 states and 14656 transitions. Second operand 5 states. [2019-12-27 05:24:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:40,118 INFO L93 Difference]: Finished difference Result 9723 states and 21829 transitions. [2019-12-27 05:24:40,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:24:40,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 05:24:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:40,130 INFO L225 Difference]: With dead ends: 9723 [2019-12-27 05:24:40,130 INFO L226 Difference]: Without dead ends: 7827 [2019-12-27 05:24:40,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:24:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7827 states. [2019-12-27 05:24:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7827 to 7827. [2019-12-27 05:24:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7827 states. [2019-12-27 05:24:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7827 states to 7827 states and 17603 transitions. [2019-12-27 05:24:40,256 INFO L78 Accepts]: Start accepts. Automaton has 7827 states and 17603 transitions. Word has length 41 [2019-12-27 05:24:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:40,256 INFO L462 AbstractCegarLoop]: Abstraction has 7827 states and 17603 transitions. [2019-12-27 05:24:40,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 7827 states and 17603 transitions. [2019-12-27 05:24:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 05:24:40,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:40,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:40,272 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash 729473288, now seen corresponding path program 1 times [2019-12-27 05:24:40,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:40,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69878526] [2019-12-27 05:24:40,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:40,445 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-27 05:24:40,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69878526] [2019-12-27 05:24:40,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:40,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:24:40,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566602403] [2019-12-27 05:24:40,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:40,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:40,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:40,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:40,450 INFO L87 Difference]: Start difference. First operand 7827 states and 17603 transitions. Second operand 5 states. [2019-12-27 05:24:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:40,964 INFO L93 Difference]: Finished difference Result 8964 states and 19904 transitions. [2019-12-27 05:24:40,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:24:40,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 05:24:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:40,977 INFO L225 Difference]: With dead ends: 8964 [2019-12-27 05:24:40,977 INFO L226 Difference]: Without dead ends: 8964 [2019-12-27 05:24:40,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:24:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8964 states. [2019-12-27 05:24:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8964 to 8619. [2019-12-27 05:24:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8619 states. [2019-12-27 05:24:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8619 states to 8619 states and 19234 transitions. [2019-12-27 05:24:41,110 INFO L78 Accepts]: Start accepts. Automaton has 8619 states and 19234 transitions. Word has length 42 [2019-12-27 05:24:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:41,111 INFO L462 AbstractCegarLoop]: Abstraction has 8619 states and 19234 transitions. [2019-12-27 05:24:41,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 8619 states and 19234 transitions. [2019-12-27 05:24:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 05:24:41,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:41,125 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] [2019-12-27 05:24:41,125 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1524647087, now seen corresponding path program 1 times [2019-12-27 05:24:41,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:41,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769689708] [2019-12-27 05:24:41,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:41,497 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-27 05:24:41,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769689708] [2019-12-27 05:24:41,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:41,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:24:41,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363327620] [2019-12-27 05:24:41,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:41,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:41,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:41,500 INFO L87 Difference]: Start difference. First operand 8619 states and 19234 transitions. Second operand 5 states. [2019-12-27 05:24:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:41,984 INFO L93 Difference]: Finished difference Result 9519 states and 20886 transitions. [2019-12-27 05:24:41,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:24:41,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 05:24:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:41,993 INFO L225 Difference]: With dead ends: 9519 [2019-12-27 05:24:41,993 INFO L226 Difference]: Without dead ends: 9519 [2019-12-27 05:24:41,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:24:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9519 states. [2019-12-27 05:24:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9519 to 8582. [2019-12-27 05:24:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8582 states. [2019-12-27 05:24:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 18775 transitions. [2019-12-27 05:24:42,088 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 18775 transitions. Word has length 43 [2019-12-27 05:24:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:42,088 INFO L462 AbstractCegarLoop]: Abstraction has 8582 states and 18775 transitions. [2019-12-27 05:24:42,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 18775 transitions. [2019-12-27 05:24:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 05:24:42,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:42,097 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] [2019-12-27 05:24:42,098 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:42,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:42,098 INFO L82 PathProgramCache]: Analyzing trace with hash 4854504, now seen corresponding path program 1 times [2019-12-27 05:24:42,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:42,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046546367] [2019-12-27 05:24:42,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:42,186 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-27 05:24:42,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046546367] [2019-12-27 05:24:42,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:42,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:24:42,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273794990] [2019-12-27 05:24:42,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:24:42,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:24:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:24:42,188 INFO L87 Difference]: Start difference. First operand 8582 states and 18775 transitions. Second operand 5 states. [2019-12-27 05:24:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:42,248 INFO L93 Difference]: Finished difference Result 5737 states and 12430 transitions. [2019-12-27 05:24:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:24:42,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 05:24:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:42,255 INFO L225 Difference]: With dead ends: 5737 [2019-12-27 05:24:42,255 INFO L226 Difference]: Without dead ends: 5409 [2019-12-27 05:24:42,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:24:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2019-12-27 05:24:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5124. [2019-12-27 05:24:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-12-27 05:24:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 11217 transitions. [2019-12-27 05:24:42,346 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 11217 transitions. Word has length 43 [2019-12-27 05:24:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:42,348 INFO L462 AbstractCegarLoop]: Abstraction has 5124 states and 11217 transitions. [2019-12-27 05:24:42,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:24:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 11217 transitions. [2019-12-27 05:24:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:42,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:42,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:42,359 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:42,359 INFO L82 PathProgramCache]: Analyzing trace with hash 664606617, now seen corresponding path program 1 times [2019-12-27 05:24:42,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:42,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614276708] [2019-12-27 05:24:42,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:42,471 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-27 05:24:42,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614276708] [2019-12-27 05:24:42,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:42,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:24:42,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457889010] [2019-12-27 05:24:42,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:24:42,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:42,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:24:42,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:24:42,475 INFO L87 Difference]: Start difference. First operand 5124 states and 11217 transitions. Second operand 4 states. [2019-12-27 05:24:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:42,505 INFO L93 Difference]: Finished difference Result 5956 states and 12941 transitions. [2019-12-27 05:24:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:24:42,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 05:24:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:42,507 INFO L225 Difference]: With dead ends: 5956 [2019-12-27 05:24:42,507 INFO L226 Difference]: Without dead ends: 901 [2019-12-27 05:24:42,510 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-27 05:24:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-27 05:24:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2019-12-27 05:24:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-12-27 05:24:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1817 transitions. [2019-12-27 05:24:42,521 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1817 transitions. Word has length 59 [2019-12-27 05:24:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:42,522 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1817 transitions. [2019-12-27 05:24:42,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:24:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1817 transitions. [2019-12-27 05:24:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:42,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:42,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:42,529 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1824485506, now seen corresponding path program 1 times [2019-12-27 05:24:42,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:42,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152969758] [2019-12-27 05:24:42,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:42,634 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-27 05:24:42,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152969758] [2019-12-27 05:24:42,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:42,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:24:42,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055227189] [2019-12-27 05:24:42,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:24:42,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:42,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:24:42,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:24:42,637 INFO L87 Difference]: Start difference. First operand 901 states and 1817 transitions. Second operand 8 states. [2019-12-27 05:24:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:42,933 INFO L93 Difference]: Finished difference Result 1857 states and 3578 transitions. [2019-12-27 05:24:42,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 05:24:42,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-27 05:24:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:42,935 INFO L225 Difference]: With dead ends: 1857 [2019-12-27 05:24:42,935 INFO L226 Difference]: Without dead ends: 1326 [2019-12-27 05:24:42,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:24:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-27 05:24:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 952. [2019-12-27 05:24:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-27 05:24:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1893 transitions. [2019-12-27 05:24:42,950 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1893 transitions. Word has length 59 [2019-12-27 05:24:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:42,950 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1893 transitions. [2019-12-27 05:24:42,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:24:42,950 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1893 transitions. [2019-12-27 05:24:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:42,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:42,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:42,952 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1605661378, now seen corresponding path program 2 times [2019-12-27 05:24:42,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:42,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538935907] [2019-12-27 05:24:42,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:43,112 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-27 05:24:43,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538935907] [2019-12-27 05:24:43,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:43,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:24:43,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163891232] [2019-12-27 05:24:43,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:24:43,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:43,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:24:43,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:24:43,115 INFO L87 Difference]: Start difference. First operand 952 states and 1893 transitions. Second operand 9 states. [2019-12-27 05:24:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:43,634 INFO L93 Difference]: Finished difference Result 1470 states and 2832 transitions. [2019-12-27 05:24:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:24:43,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-12-27 05:24:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:43,637 INFO L225 Difference]: With dead ends: 1470 [2019-12-27 05:24:43,637 INFO L226 Difference]: Without dead ends: 1470 [2019-12-27 05:24:43,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:24:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-12-27 05:24:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 961. [2019-12-27 05:24:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-12-27 05:24:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1911 transitions. [2019-12-27 05:24:43,650 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1911 transitions. Word has length 59 [2019-12-27 05:24:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:43,650 INFO L462 AbstractCegarLoop]: Abstraction has 961 states and 1911 transitions. [2019-12-27 05:24:43,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:24:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1911 transitions. [2019-12-27 05:24:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:43,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:43,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:43,652 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:43,652 INFO L82 PathProgramCache]: Analyzing trace with hash 695697502, now seen corresponding path program 3 times [2019-12-27 05:24:43,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:43,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711902228] [2019-12-27 05:24:43,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:43,734 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-27 05:24:43,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711902228] [2019-12-27 05:24:43,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:43,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:24:43,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444756682] [2019-12-27 05:24:43,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:24:43,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:43,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:24:43,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:24:43,736 INFO L87 Difference]: Start difference. First operand 961 states and 1911 transitions. Second operand 6 states. [2019-12-27 05:24:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:44,193 INFO L93 Difference]: Finished difference Result 1170 states and 2280 transitions. [2019-12-27 05:24:44,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:24:44,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 05:24:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:44,195 INFO L225 Difference]: With dead ends: 1170 [2019-12-27 05:24:44,195 INFO L226 Difference]: Without dead ends: 1170 [2019-12-27 05:24:44,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:24:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-27 05:24:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 991. [2019-12-27 05:24:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-12-27 05:24:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1966 transitions. [2019-12-27 05:24:44,206 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1966 transitions. Word has length 59 [2019-12-27 05:24:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:44,206 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1966 transitions. [2019-12-27 05:24:44,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:24:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1966 transitions. [2019-12-27 05:24:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 05:24:44,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:44,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:44,207 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:44,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:44,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1043077686, now seen corresponding path program 4 times [2019-12-27 05:24:44,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:44,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050904867] [2019-12-27 05:24:44,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:24:44,268 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-27 05:24:44,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050904867] [2019-12-27 05:24:44,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:24:44,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:24:44,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944975390] [2019-12-27 05:24:44,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:24:44,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:24:44,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:24:44,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:24:44,270 INFO L87 Difference]: Start difference. First operand 991 states and 1966 transitions. Second operand 3 states. [2019-12-27 05:24:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:24:44,282 INFO L93 Difference]: Finished difference Result 990 states and 1964 transitions. [2019-12-27 05:24:44,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:24:44,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 05:24:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:24:44,284 INFO L225 Difference]: With dead ends: 990 [2019-12-27 05:24:44,284 INFO L226 Difference]: Without dead ends: 990 [2019-12-27 05:24:44,285 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-27 05:24:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-27 05:24:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 847. [2019-12-27 05:24:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-27 05:24:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1701 transitions. [2019-12-27 05:24:44,296 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1701 transitions. Word has length 59 [2019-12-27 05:24:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:24:44,296 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1701 transitions. [2019-12-27 05:24:44,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:24:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1701 transitions. [2019-12-27 05:24:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 05:24:44,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:24:44,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:24:44,298 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:24:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:24:44,298 INFO L82 PathProgramCache]: Analyzing trace with hash 385115502, now seen corresponding path program 1 times [2019-12-27 05:24:44,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:24:44,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627109479] [2019-12-27 05:24:44,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:24:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:24:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:24:44,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:24:44,424 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:24:44,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_130) (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$r_buff0_thd1~0_51) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t311~0.base_27| 1)) (= 0 |v_ULTIMATE.start_main_~#t311~0.offset_21|) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~x$r_buff1_thd2~0_38 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t311~0.base_27| 4) |v_#length_19|) (= |v_#NULL.offset_3| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_27| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_27|) |v_ULTIMATE.start_main_~#t311~0.offset_21| 0)) |v_#memory_int_17|) (= v_~x$flush_delayed~0_17 0) (= v_~x$r_buff1_thd0~0_23 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t311~0.base_27|) 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_36) (= v_~x~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_35) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_17) (= v_~main$tmp_guard0~0_11 0) (= v_~x$r_buff1_thd1~0_27 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t311~0.base_27|) (= 0 v_~x$r_buff0_thd2~0_75) (= 0 v_~x$w_buff1~0_30) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_51, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, #length=|v_#length_19|, ~y~0=v_~y~0_9, ULTIMATE.start_main_~#t311~0.offset=|v_ULTIMATE.start_main_~#t311~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_14|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_13|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_38, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_23, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, ULTIMATE.start_main_~#t311~0.base=|v_ULTIMATE.start_main_~#t311~0.base_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_25|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x~0=v_~x~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t312~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t311~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t311~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 05:24:44,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L808-1-->L810: Formula: (and (not (= |v_ULTIMATE.start_main_~#t312~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11|) |v_ULTIMATE.start_main_~#t312~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t312~0.offset_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11| 1)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11|) 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t312~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t312~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, #length, ULTIMATE.start_main_~#t312~0.offset] because there is no mapped edge [2019-12-27 05:24:44,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_19 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 0 (mod v_~x$w_buff1_used~0_51 256)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= v_~x$w_buff1_used~0_51 v_~x$w_buff0_used~0_89) (= 1 v_~x$w_buff0_used~0_88) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= 1 v_~x$w_buff0~0_18)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 05:24:44,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1986482109 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1986482109 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1986482109| ~x$w_buff1~0_In-1986482109) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1986482109| ~x$w_buff0~0_In-1986482109) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1986482109, ~x$w_buff1~0=~x$w_buff1~0_In-1986482109, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1986482109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1986482109} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1986482109, ~x$w_buff1~0=~x$w_buff1~0_In-1986482109, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1986482109, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1986482109|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1986482109} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 05:24:44,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_21 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~x~0=v_~x~0_21, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 05:24:44,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_64 v_~x$r_buff0_thd2~0_63) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_9|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_8|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_10|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 05:24:44,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-93734986 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out-93734986| ~x$mem_tmp~0_In-93734986) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out-93734986| ~x~0_In-93734986) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-93734986, ~x$mem_tmp~0=~x$mem_tmp~0_In-93734986, ~x~0=~x~0_In-93734986} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-93734986, ~x$mem_tmp~0=~x$mem_tmp~0_In-93734986, ~x~0=~x~0_In-93734986, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-93734986|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 05:24:44,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In22268801 256)))) (or (and (not .cse0) (= ~x$mem_tmp~0_In22268801 |P0Thread1of1ForFork0_#t~ite25_Out22268801|)) (and .cse0 (= ~x~0_In22268801 |P0Thread1of1ForFork0_#t~ite25_Out22268801|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In22268801, ~x$mem_tmp~0=~x$mem_tmp~0_In22268801, ~x~0=~x~0_In22268801} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out22268801|, ~x$flush_delayed~0=~x$flush_delayed~0_In22268801, ~x$mem_tmp~0=~x$mem_tmp~0_In22268801, ~x~0=~x~0_In22268801} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 05:24:44,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= v_~x~0_24 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= v_~x$flush_delayed~0_12 0) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 05:24:44,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-639667144 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-639667144 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-639667144|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-639667144 |P1Thread1of1ForFork1_#t~ite51_Out-639667144|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-639667144, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-639667144} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-639667144|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-639667144, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-639667144} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 05:24:44,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-240285056 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-240285056 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-240285056 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-240285056 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-240285056 |P1Thread1of1ForFork1_#t~ite52_Out-240285056|)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out-240285056| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-240285056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-240285056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-240285056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-240285056} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-240285056|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-240285056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-240285056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-240285056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-240285056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 05:24:44,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1845729701 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1845729701 256)))) (or (and (= ~x$r_buff0_thd2~0_In1845729701 ~x$r_buff0_thd2~0_Out1845729701) (or .cse0 .cse1)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out1845729701 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1845729701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1845729701} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out1845729701|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1845729701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1845729701} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 05:24:44,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In2111288721 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2111288721 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2111288721 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In2111288721 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite54_Out2111288721| ~x$r_buff1_thd2~0_In2111288721)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out2111288721| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2111288721, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2111288721, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2111288721, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2111288721} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2111288721, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2111288721, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out2111288721|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2111288721, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2111288721} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 05:24:44,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_33 |v_P1Thread1of1ForFork1_#t~ite54_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 05:24:44,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$w_buff0_used~0_102 256)) (= (mod v_~x$r_buff0_thd0~0_15 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:24:44,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1807675358 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1807675358 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1807675358 |ULTIMATE.start_main_#t~ite57_Out-1807675358|)) (and (or .cse1 .cse0) (= ~x~0_In-1807675358 |ULTIMATE.start_main_#t~ite57_Out-1807675358|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1807675358, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1807675358, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1807675358, ~x~0=~x~0_In-1807675358} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1807675358, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1807675358|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1807675358, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1807675358, ~x~0=~x~0_In-1807675358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 05:24:44,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_23 |v_ULTIMATE.start_main_#t~ite57_8|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-27 05:24:44,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1949808589 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1949808589 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite59_Out1949808589|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1949808589 |ULTIMATE.start_main_#t~ite59_Out1949808589|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1949808589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949808589} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1949808589, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1949808589|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1949808589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 05:24:44,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1370876285 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1370876285 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1370876285 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1370876285 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1370876285 |ULTIMATE.start_main_#t~ite60_Out1370876285|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite60_Out1370876285|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1370876285, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1370876285, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1370876285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1370876285} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1370876285, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1370876285|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1370876285, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1370876285, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1370876285} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 05:24:44,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1904377070 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1904377070 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1904377070| ~x$r_buff0_thd0~0_In1904377070) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out1904377070| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1904377070, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1904377070} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1904377070, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1904377070|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1904377070} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 05:24:44,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1633263172 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1633263172 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1633263172 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1633263172 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out-1633263172| ~x$r_buff1_thd0~0_In-1633263172)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1633263172| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1633263172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1633263172, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1633263172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1633263172} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1633263172|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1633263172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1633263172, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1633263172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1633263172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 05:24:44,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite62_11|) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:24:44,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:24:44 BasicIcfg [2019-12-27 05:24:44,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:24:44,569 INFO L168 Benchmark]: Toolchain (without parser) took 42605.22 ms. Allocated memory was 143.7 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 99.9 MB in the beginning and 891.1 MB in the end (delta: -791.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 05:24:44,570 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:24:44,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.21 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 152.4 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:44,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.92 ms. Allocated memory is still 200.8 MB. Free memory was 152.4 MB in the beginning and 148.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:44,572 INFO L168 Benchmark]: Boogie Preprocessor took 39.08 ms. Allocated memory is still 200.8 MB. Free memory was 148.9 MB in the beginning and 146.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:44,572 INFO L168 Benchmark]: RCFGBuilder took 1125.74 ms. Allocated memory is still 200.8 MB. Free memory was 146.7 MB in the beginning and 93.7 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:24:44,573 INFO L168 Benchmark]: TraceAbstraction took 40547.87 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 93.0 MB in the beginning and 891.1 MB in the end (delta: -798.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 05:24:44,576 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.79 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.21 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 152.4 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.92 ms. Allocated memory is still 200.8 MB. Free memory was 152.4 MB in the beginning and 148.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.08 ms. Allocated memory is still 200.8 MB. Free memory was 148.9 MB in the beginning and 146.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1125.74 ms. Allocated memory is still 200.8 MB. Free memory was 146.7 MB in the beginning and 93.7 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40547.87 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 93.0 MB in the beginning and 891.1 MB in the end (delta: -798.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 178 ProgramPointsBefore, 107 ProgramPointsAfterwards, 227 TransitionsBefore, 132 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 27 ChoiceCompositions, 8652 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 131854 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L808] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L819] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 40.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3932 SDtfs, 3753 SDslu, 6502 SDs, 0 SdLazy, 3318 SolverSat, 184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65331occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 49927 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 80523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...