/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi010_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:04:52,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:04:52,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:04:52,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:04:52,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:04:52,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:04:52,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:04:52,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:04:52,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:04:52,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:04:52,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:04:52,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:04:52,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:04:52,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:04:52,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:04:52,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:04:52,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:04:52,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:04:52,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:04:52,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:04:52,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:04:52,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:04:52,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:04:52,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:04:52,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:04:52,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:04:52,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:04:52,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:04:52,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:04:52,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:04:52,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:04:52,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:04:52,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:04:52,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:04:52,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:04:52,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:04:52,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:04:52,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:04:52,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:04:52,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:04:52,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:04:52,605 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-MCR.epf [2019-12-27 22:04:52,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:04:52,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:04:52,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:04:52,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:04:52,622 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:04:52,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:04:52,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:04:52,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:04:52,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:04:52,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:04:52,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:04:52,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:04:52,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:04:52,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:04:52,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:04:52,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:04:52,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:04:52,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:04:52,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:04:52,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:04:52,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:04:52,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:04:52,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:04:52,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:04:52,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:04:52,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:04:52,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:04:52,627 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:04:52,627 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:04:52,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:04:52,627 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:04:52,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:04:53,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:04:53,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:04:53,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:04:53,045 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:04:53,046 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:04:53,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_pso.opt.i [2019-12-27 22:04:53,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b00b891a/1f519409c6b94896af3a3f69423f4bfb/FLAG445436f7b [2019-12-27 22:04:53,732 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:04:53,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_pso.opt.i [2019-12-27 22:04:53,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b00b891a/1f519409c6b94896af3a3f69423f4bfb/FLAG445436f7b [2019-12-27 22:04:53,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b00b891a/1f519409c6b94896af3a3f69423f4bfb [2019-12-27 22:04:53,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:04:53,980 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:04:53,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:04:53,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:04:53,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:04:53,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:04:53" (1/1) ... [2019-12-27 22:04:53,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:53, skipping insertion in model container [2019-12-27 22:04:53,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:04:53" (1/1) ... [2019-12-27 22:04:54,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:04:54,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:04:54,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:04:54,641 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:04:54,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:04:54,812 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:04:54,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54 WrapperNode [2019-12-27 22:04:54,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:04:54,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:04:54,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:04:54,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:04:54,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (1/1) ... [2019-12-27 22:04:54,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (1/1) ... [2019-12-27 22:04:54,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:04:54,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:04:54,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:04:54,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:04:54,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (1/1) ... [2019-12-27 22:04:54,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (1/1) ... [2019-12-27 22:04:54,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (1/1) ... [2019-12-27 22:04:54,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (1/1) ... [2019-12-27 22:04:54,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (1/1) ... [2019-12-27 22:04:54,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (1/1) ... [2019-12-27 22:04:54,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (1/1) ... [2019-12-27 22:04:54,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:04:54,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:04:54,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:04:54,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:04:54,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (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 22:04:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:04:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:04:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:04:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:04:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:04:55,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:04:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:04:55,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:04:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:04:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:04:55,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:04:55,026 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 22:04:55,884 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:04:55,885 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:04:55,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:04:55 BoogieIcfgContainer [2019-12-27 22:04:55,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:04:55,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:04:55,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:04:55,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:04:55,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:04:53" (1/3) ... [2019-12-27 22:04:55,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b2a24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:04:55, skipping insertion in model container [2019-12-27 22:04:55,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:04:54" (2/3) ... [2019-12-27 22:04:55,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b2a24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:04:55, skipping insertion in model container [2019-12-27 22:04:55,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:04:55" (3/3) ... [2019-12-27 22:04:55,899 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_pso.opt.i [2019-12-27 22:04:55,907 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:04:55,908 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:04:55,915 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:04:55,930 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:04:55,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,984 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:55,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,011 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,063 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,090 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:04:56,109 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 22:04:56,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:04:56,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:04:56,131 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:04:56,131 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:04:56,131 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:04:56,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:04:56,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:04:56,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:04:56,149 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-27 22:04:56,150 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 22:04:56,289 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 22:04:56,289 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:04:56,310 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 552 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 22:04:56,338 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 22:04:56,399 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 22:04:56,399 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:04:56,409 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 552 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 22:04:56,440 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 22:04:56,441 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:04:59,697 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 22:04:59,814 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 22:04:59,918 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128953 [2019-12-27 22:04:59,918 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 22:04:59,922 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 130 transitions [2019-12-27 22:05:01,452 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25606 states. [2019-12-27 22:05:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 25606 states. [2019-12-27 22:05:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:05:01,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:01,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:05:01,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:01,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash 955833670, now seen corresponding path program 1 times [2019-12-27 22:05:01,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:01,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684202348] [2019-12-27 22:05:01,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:01,707 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 22:05:01,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684202348] [2019-12-27 22:05:01,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:01,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:05:01,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1603789208] [2019-12-27 22:05:01,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:01,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:01,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:05:01,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:01,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:01,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:05:01,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:01,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:05:01,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:05:01,739 INFO L87 Difference]: Start difference. First operand 25606 states. Second operand 3 states. [2019-12-27 22:05:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:02,893 INFO L93 Difference]: Finished difference Result 25281 states and 91100 transitions. [2019-12-27 22:05:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:05:02,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:05:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:03,138 INFO L225 Difference]: With dead ends: 25281 [2019-12-27 22:05:03,142 INFO L226 Difference]: Without dead ends: 23653 [2019-12-27 22:05:03,145 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 22:05:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23653 states. [2019-12-27 22:05:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23653 to 23653. [2019-12-27 22:05:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23653 states. [2019-12-27 22:05:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23653 states to 23653 states and 85170 transitions. [2019-12-27 22:05:04,924 INFO L78 Accepts]: Start accepts. Automaton has 23653 states and 85170 transitions. Word has length 5 [2019-12-27 22:05:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:04,925 INFO L462 AbstractCegarLoop]: Abstraction has 23653 states and 85170 transitions. [2019-12-27 22:05:04,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:05:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 23653 states and 85170 transitions. [2019-12-27 22:05:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:05:04,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:04,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:05:04,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:04,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:04,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2053033798, now seen corresponding path program 1 times [2019-12-27 22:05:04,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:04,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736801170] [2019-12-27 22:05:04,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:05:05,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736801170] [2019-12-27 22:05:05,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:05,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:05:05,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1198503754] [2019-12-27 22:05:05,103 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:05,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:05,110 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:05:05,110 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:05,111 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:05,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:05:05,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:05:05,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:05:05,114 INFO L87 Difference]: Start difference. First operand 23653 states and 85170 transitions. Second operand 4 states. [2019-12-27 22:05:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:05,903 INFO L93 Difference]: Finished difference Result 36524 states and 125619 transitions. [2019-12-27 22:05:05,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:05:05,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:05:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:06,054 INFO L225 Difference]: With dead ends: 36524 [2019-12-27 22:05:06,054 INFO L226 Difference]: Without dead ends: 36506 [2019-12-27 22:05:06,055 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 22:05:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36506 states. [2019-12-27 22:05:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36506 to 35525. [2019-12-27 22:05:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35525 states. [2019-12-27 22:05:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35525 states to 35525 states and 123056 transitions. [2019-12-27 22:05:08,773 INFO L78 Accepts]: Start accepts. Automaton has 35525 states and 123056 transitions. Word has length 11 [2019-12-27 22:05:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:08,774 INFO L462 AbstractCegarLoop]: Abstraction has 35525 states and 123056 transitions. [2019-12-27 22:05:08,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:05:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 35525 states and 123056 transitions. [2019-12-27 22:05:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:05:08,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:08,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:05:08,779 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash -892525895, now seen corresponding path program 1 times [2019-12-27 22:05:08,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:08,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478298129] [2019-12-27 22:05:08,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:08,834 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 22:05:08,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478298129] [2019-12-27 22:05:08,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:08,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:05:08,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1134069419] [2019-12-27 22:05:08,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:08,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:08,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:05:08,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:08,876 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:05:08,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:05:08,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:08,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:05:08,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:05:08,878 INFO L87 Difference]: Start difference. First operand 35525 states and 123056 transitions. Second operand 5 states. [2019-12-27 22:05:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:09,689 INFO L93 Difference]: Finished difference Result 44942 states and 153244 transitions. [2019-12-27 22:05:09,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:05:09,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:05:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:09,959 INFO L225 Difference]: With dead ends: 44942 [2019-12-27 22:05:09,959 INFO L226 Difference]: Without dead ends: 44927 [2019-12-27 22:05:09,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:05:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44927 states. [2019-12-27 22:05:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44927 to 40275. [2019-12-27 22:05:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40275 states. [2019-12-27 22:05:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40275 states to 40275 states and 138859 transitions. [2019-12-27 22:05:13,786 INFO L78 Accepts]: Start accepts. Automaton has 40275 states and 138859 transitions. Word has length 14 [2019-12-27 22:05:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:13,787 INFO L462 AbstractCegarLoop]: Abstraction has 40275 states and 138859 transitions. [2019-12-27 22:05:13,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:05:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 40275 states and 138859 transitions. [2019-12-27 22:05:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 22:05:13,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:13,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:05:13,794 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -443520256, now seen corresponding path program 1 times [2019-12-27 22:05:13,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:13,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954694105] [2019-12-27 22:05:13,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:13,853 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 22:05:13,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954694105] [2019-12-27 22:05:13,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:13,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:05:13,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1404871420] [2019-12-27 22:05:13,854 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:13,856 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:13,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 18 transitions. [2019-12-27 22:05:13,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:13,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:13,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:05:13,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:05:13,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:05:13,860 INFO L87 Difference]: Start difference. First operand 40275 states and 138859 transitions. Second operand 3 states. [2019-12-27 22:05:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:14,012 INFO L93 Difference]: Finished difference Result 37942 states and 130605 transitions. [2019-12-27 22:05:14,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:05:14,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 22:05:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:14,112 INFO L225 Difference]: With dead ends: 37942 [2019-12-27 22:05:14,112 INFO L226 Difference]: Without dead ends: 37834 [2019-12-27 22:05:14,113 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 22:05:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37834 states. [2019-12-27 22:05:15,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37834 to 37834. [2019-12-27 22:05:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37834 states. [2019-12-27 22:05:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37834 states to 37834 states and 130269 transitions. [2019-12-27 22:05:15,352 INFO L78 Accepts]: Start accepts. Automaton has 37834 states and 130269 transitions. Word has length 16 [2019-12-27 22:05:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:15,353 INFO L462 AbstractCegarLoop]: Abstraction has 37834 states and 130269 transitions. [2019-12-27 22:05:15,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:05:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 37834 states and 130269 transitions. [2019-12-27 22:05:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 22:05:15,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:15,365 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 22:05:15,365 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:15,365 INFO L82 PathProgramCache]: Analyzing trace with hash 670002989, now seen corresponding path program 1 times [2019-12-27 22:05:15,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:15,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534161067] [2019-12-27 22:05:15,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:15,480 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 22:05:15,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534161067] [2019-12-27 22:05:15,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:15,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:05:15,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808567328] [2019-12-27 22:05:15,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:15,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:15,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 98 transitions. [2019-12-27 22:05:15,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:15,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:05:15,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:05:15,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:15,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:05:15,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:05:15,563 INFO L87 Difference]: Start difference. First operand 37834 states and 130269 transitions. Second operand 6 states. [2019-12-27 22:05:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:16,437 INFO L93 Difference]: Finished difference Result 8158 states and 23186 transitions. [2019-12-27 22:05:16,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:05:16,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-27 22:05:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:16,446 INFO L225 Difference]: With dead ends: 8158 [2019-12-27 22:05:16,447 INFO L226 Difference]: Without dead ends: 4914 [2019-12-27 22:05:16,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:05:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4914 states. [2019-12-27 22:05:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4914 to 4416. [2019-12-27 22:05:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4416 states. [2019-12-27 22:05:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 10893 transitions. [2019-12-27 22:05:16,523 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 10893 transitions. Word has length 20 [2019-12-27 22:05:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:16,523 INFO L462 AbstractCegarLoop]: Abstraction has 4416 states and 10893 transitions. [2019-12-27 22:05:16,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:05:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 10893 transitions. [2019-12-27 22:05:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:05:16,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:16,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:05:16,528 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash 774115384, now seen corresponding path program 1 times [2019-12-27 22:05:16,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:16,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197659222] [2019-12-27 22:05:16,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:16,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 22:05:16,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197659222] [2019-12-27 22:05:16,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:16,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:05:16,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1373559715] [2019-12-27 22:05:16,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:16,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:16,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 96 transitions. [2019-12-27 22:05:16,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:16,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:05:16,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:05:16,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:05:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:05:16,680 INFO L87 Difference]: Start difference. First operand 4416 states and 10893 transitions. Second operand 6 states. [2019-12-27 22:05:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:17,132 INFO L93 Difference]: Finished difference Result 4901 states and 11868 transitions. [2019-12-27 22:05:17,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:05:17,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 22:05:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:17,139 INFO L225 Difference]: With dead ends: 4901 [2019-12-27 22:05:17,140 INFO L226 Difference]: Without dead ends: 4900 [2019-12-27 22:05:17,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:05:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2019-12-27 22:05:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 4642. [2019-12-27 22:05:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2019-12-27 22:05:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 11370 transitions. [2019-12-27 22:05:17,202 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 11370 transitions. Word has length 28 [2019-12-27 22:05:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:17,202 INFO L462 AbstractCegarLoop]: Abstraction has 4642 states and 11370 transitions. [2019-12-27 22:05:17,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:05:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 11370 transitions. [2019-12-27 22:05:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:05:17,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:17,211 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 22:05:17,211 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash -691824666, now seen corresponding path program 1 times [2019-12-27 22:05:17,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:17,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998084440] [2019-12-27 22:05:17,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:17,311 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 22:05:17,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998084440] [2019-12-27 22:05:17,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:17,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:05:17,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067304023] [2019-12-27 22:05:17,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:17,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:17,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 41 transitions. [2019-12-27 22:05:17,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:17,339 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:17,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:05:17,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:17,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:05:17,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:05:17,340 INFO L87 Difference]: Start difference. First operand 4642 states and 11370 transitions. Second operand 5 states. [2019-12-27 22:05:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:17,449 INFO L93 Difference]: Finished difference Result 7800 states and 19310 transitions. [2019-12-27 22:05:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:05:17,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 22:05:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:17,457 INFO L225 Difference]: With dead ends: 7800 [2019-12-27 22:05:17,457 INFO L226 Difference]: Without dead ends: 6061 [2019-12-27 22:05:17,457 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 22:05:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2019-12-27 22:05:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 6061. [2019-12-27 22:05:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6061 states. [2019-12-27 22:05:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6061 states to 6061 states and 15179 transitions. [2019-12-27 22:05:17,521 INFO L78 Accepts]: Start accepts. Automaton has 6061 states and 15179 transitions. Word has length 41 [2019-12-27 22:05:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:17,522 INFO L462 AbstractCegarLoop]: Abstraction has 6061 states and 15179 transitions. [2019-12-27 22:05:17,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:05:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6061 states and 15179 transitions. [2019-12-27 22:05:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:05:17,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:17,532 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 22:05:17,532 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -266606394, now seen corresponding path program 1 times [2019-12-27 22:05:17,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:17,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984080187] [2019-12-27 22:05:17,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:17,616 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 22:05:17,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984080187] [2019-12-27 22:05:17,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:17,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:05:17,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1123663601] [2019-12-27 22:05:17,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:17,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:17,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 42 transitions. [2019-12-27 22:05:17,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:17,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:17,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:05:17,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:05:17,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:05:17,641 INFO L87 Difference]: Start difference. First operand 6061 states and 15179 transitions. Second operand 5 states. [2019-12-27 22:05:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:18,089 INFO L93 Difference]: Finished difference Result 6793 states and 16746 transitions. [2019-12-27 22:05:18,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:05:18,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 22:05:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:18,098 INFO L225 Difference]: With dead ends: 6793 [2019-12-27 22:05:18,098 INFO L226 Difference]: Without dead ends: 6793 [2019-12-27 22:05:18,099 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 22:05:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2019-12-27 22:05:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 6569. [2019-12-27 22:05:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6569 states. [2019-12-27 22:05:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6569 states to 6569 states and 16312 transitions. [2019-12-27 22:05:18,260 INFO L78 Accepts]: Start accepts. Automaton has 6569 states and 16312 transitions. Word has length 42 [2019-12-27 22:05:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:18,261 INFO L462 AbstractCegarLoop]: Abstraction has 6569 states and 16312 transitions. [2019-12-27 22:05:18,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:05:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6569 states and 16312 transitions. [2019-12-27 22:05:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 22:05:18,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:18,276 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 22:05:18,276 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 760738031, now seen corresponding path program 1 times [2019-12-27 22:05:18,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:18,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563730472] [2019-12-27 22:05:18,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:18,380 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 22:05:18,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563730472] [2019-12-27 22:05:18,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:18,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:05:18,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [217809176] [2019-12-27 22:05:18,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:18,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:18,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 22:05:18,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:18,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:18,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:05:18,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:18,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:05:18,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:05:18,423 INFO L87 Difference]: Start difference. First operand 6569 states and 16312 transitions. Second operand 5 states. [2019-12-27 22:05:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:18,854 INFO L93 Difference]: Finished difference Result 7792 states and 18760 transitions. [2019-12-27 22:05:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:05:18,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 22:05:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:18,862 INFO L225 Difference]: With dead ends: 7792 [2019-12-27 22:05:18,863 INFO L226 Difference]: Without dead ends: 7792 [2019-12-27 22:05:18,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:05:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7792 states. [2019-12-27 22:05:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7792 to 6562. [2019-12-27 22:05:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6562 states. [2019-12-27 22:05:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 15795 transitions. [2019-12-27 22:05:18,978 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 15795 transitions. Word has length 43 [2019-12-27 22:05:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:18,978 INFO L462 AbstractCegarLoop]: Abstraction has 6562 states and 15795 transitions. [2019-12-27 22:05:18,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:05:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 15795 transitions. [2019-12-27 22:05:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 22:05:18,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:18,991 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 22:05:18,991 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:18,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1336735023, now seen corresponding path program 1 times [2019-12-27 22:05:18,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:18,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132590063] [2019-12-27 22:05:18,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:19,085 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 22:05:19,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132590063] [2019-12-27 22:05:19,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:19,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:05:19,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1809356074] [2019-12-27 22:05:19,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:19,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:19,110 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 22:05:19,110 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:19,111 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:19,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:05:19,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:05:19,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:05:19,112 INFO L87 Difference]: Start difference. First operand 6562 states and 15795 transitions. Second operand 5 states. [2019-12-27 22:05:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:19,163 INFO L93 Difference]: Finished difference Result 4552 states and 11045 transitions. [2019-12-27 22:05:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:05:19,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 22:05:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:19,170 INFO L225 Difference]: With dead ends: 4552 [2019-12-27 22:05:19,170 INFO L226 Difference]: Without dead ends: 4333 [2019-12-27 22:05:19,171 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 22:05:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4333 states. [2019-12-27 22:05:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4333 to 4210. [2019-12-27 22:05:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4210 states. [2019-12-27 22:05:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 10318 transitions. [2019-12-27 22:05:19,215 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 10318 transitions. Word has length 43 [2019-12-27 22:05:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:19,217 INFO L462 AbstractCegarLoop]: Abstraction has 4210 states and 10318 transitions. [2019-12-27 22:05:19,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:05:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 10318 transitions. [2019-12-27 22:05:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 22:05:19,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:19,226 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 22:05:19,226 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:19,226 INFO L82 PathProgramCache]: Analyzing trace with hash -912842167, now seen corresponding path program 1 times [2019-12-27 22:05:19,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:19,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700334937] [2019-12-27 22:05:19,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:19,334 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 22:05:19,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700334937] [2019-12-27 22:05:19,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:19,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:05:19,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1308819779] [2019-12-27 22:05:19,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:19,353 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:19,454 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 199 transitions. [2019-12-27 22:05:19,454 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:19,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:19,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:05:19,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:05:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:05:19,457 INFO L87 Difference]: Start difference. First operand 4210 states and 10318 transitions. Second operand 4 states. [2019-12-27 22:05:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:19,498 INFO L93 Difference]: Finished difference Result 5126 states and 12353 transitions. [2019-12-27 22:05:19,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:05:19,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 22:05:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:19,501 INFO L225 Difference]: With dead ends: 5126 [2019-12-27 22:05:19,501 INFO L226 Difference]: Without dead ends: 988 [2019-12-27 22:05:19,501 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 22:05:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-12-27 22:05:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2019-12-27 22:05:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-12-27 22:05:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 2139 transitions. [2019-12-27 22:05:19,517 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 2139 transitions. Word has length 59 [2019-12-27 22:05:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:19,518 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 2139 transitions. [2019-12-27 22:05:19,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:05:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 2139 transitions. [2019-12-27 22:05:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 22:05:19,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:19,521 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 22:05:19,521 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1305106490, now seen corresponding path program 1 times [2019-12-27 22:05:19,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:19,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452851913] [2019-12-27 22:05:19,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:19,618 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 22:05:19,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452851913] [2019-12-27 22:05:19,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:19,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:05:19,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1853664819] [2019-12-27 22:05:19,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:19,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:19,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 119 transitions. [2019-12-27 22:05:19,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:19,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:05:19,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:05:19,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:05:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:05:19,830 INFO L87 Difference]: Start difference. First operand 988 states and 2139 transitions. Second operand 10 states. [2019-12-27 22:05:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:20,913 INFO L93 Difference]: Finished difference Result 6951 states and 14999 transitions. [2019-12-27 22:05:20,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 22:05:20,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 22:05:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:20,918 INFO L225 Difference]: With dead ends: 6951 [2019-12-27 22:05:20,919 INFO L226 Difference]: Without dead ends: 4401 [2019-12-27 22:05:20,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:05:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2019-12-27 22:05:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 1828. [2019-12-27 22:05:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2019-12-27 22:05:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 3951 transitions. [2019-12-27 22:05:20,948 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 3951 transitions. Word has length 59 [2019-12-27 22:05:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:20,948 INFO L462 AbstractCegarLoop]: Abstraction has 1828 states and 3951 transitions. [2019-12-27 22:05:20,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:05:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 3951 transitions. [2019-12-27 22:05:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 22:05:20,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:20,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 22:05:20,952 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:20,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1508828504, now seen corresponding path program 2 times [2019-12-27 22:05:20,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:20,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654567495] [2019-12-27 22:05:20,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:05:21,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654567495] [2019-12-27 22:05:21,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:21,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:05:21,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1169215479] [2019-12-27 22:05:21,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:21,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:21,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 89 transitions. [2019-12-27 22:05:21,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:21,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:05:21,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:05:21,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:21,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:05:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:05:21,171 INFO L87 Difference]: Start difference. First operand 1828 states and 3951 transitions. Second operand 10 states. [2019-12-27 22:05:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:22,358 INFO L93 Difference]: Finished difference Result 4560 states and 9637 transitions. [2019-12-27 22:05:22,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:05:22,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 22:05:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:22,365 INFO L225 Difference]: With dead ends: 4560 [2019-12-27 22:05:22,365 INFO L226 Difference]: Without dead ends: 4543 [2019-12-27 22:05:22,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:05:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2019-12-27 22:05:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 2067. [2019-12-27 22:05:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2019-12-27 22:05:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 4540 transitions. [2019-12-27 22:05:22,397 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 4540 transitions. Word has length 59 [2019-12-27 22:05:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:22,397 INFO L462 AbstractCegarLoop]: Abstraction has 2067 states and 4540 transitions. [2019-12-27 22:05:22,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:05:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 4540 transitions. [2019-12-27 22:05:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 22:05:22,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:22,400 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 22:05:22,400 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash -279189162, now seen corresponding path program 3 times [2019-12-27 22:05:22,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:22,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341203751] [2019-12-27 22:05:22,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:22,486 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 22:05:22,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341203751] [2019-12-27 22:05:22,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:22,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:05:22,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565185417] [2019-12-27 22:05:22,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:22,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:22,623 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 168 transitions. [2019-12-27 22:05:22,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:22,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:05:22,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:05:22,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:05:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:05:22,688 INFO L87 Difference]: Start difference. First operand 2067 states and 4540 transitions. Second operand 7 states. [2019-12-27 22:05:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:23,444 INFO L93 Difference]: Finished difference Result 2818 states and 6013 transitions. [2019-12-27 22:05:23,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:05:23,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 22:05:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:23,448 INFO L225 Difference]: With dead ends: 2818 [2019-12-27 22:05:23,448 INFO L226 Difference]: Without dead ends: 2818 [2019-12-27 22:05:23,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:05:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-27 22:05:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2127. [2019-12-27 22:05:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-27 22:05:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4672 transitions. [2019-12-27 22:05:23,472 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4672 transitions. Word has length 59 [2019-12-27 22:05:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:23,472 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4672 transitions. [2019-12-27 22:05:23,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:05:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4672 transitions. [2019-12-27 22:05:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 22:05:23,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:23,477 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 22:05:23,477 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1505791602, now seen corresponding path program 4 times [2019-12-27 22:05:23,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:23,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972461715] [2019-12-27 22:05:23,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:05:23,567 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 22:05:23,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972461715] [2019-12-27 22:05:23,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:05:23,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:05:23,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [343790092] [2019-12-27 22:05:23,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:05:23,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:05:23,689 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 127 transitions. [2019-12-27 22:05:23,689 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:05:23,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:05:23,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:05:23,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:05:23,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:05:23,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:05:23,696 INFO L87 Difference]: Start difference. First operand 2127 states and 4672 transitions. Second operand 3 states. [2019-12-27 22:05:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:05:23,714 INFO L93 Difference]: Finished difference Result 2126 states and 4670 transitions. [2019-12-27 22:05:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:05:23,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 22:05:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:05:23,718 INFO L225 Difference]: With dead ends: 2126 [2019-12-27 22:05:23,718 INFO L226 Difference]: Without dead ends: 2126 [2019-12-27 22:05:23,723 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 22:05:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-27 22:05:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2018. [2019-12-27 22:05:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-12-27 22:05:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 4484 transitions. [2019-12-27 22:05:23,759 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 4484 transitions. Word has length 59 [2019-12-27 22:05:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:05:23,759 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 4484 transitions. [2019-12-27 22:05:23,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:05:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 4484 transitions. [2019-12-27 22:05:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 22:05:23,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:05:23,765 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 22:05:23,765 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:05:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:05:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash -195440625, now seen corresponding path program 1 times [2019-12-27 22:05:23,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:05:23,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862858370] [2019-12-27 22:05:23,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:05:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:05:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:05:23,943 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:05:23,945 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:05:23,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1767~0.base_17|) 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~y$w_buff0_used~0_132 0) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~y$flush_delayed~0_15) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1767~0.base_17|) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_39) (= v_~y$r_buff0_thd0~0_22 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y~0_27 0) (= 0 |v_ULTIMATE.start_main_~#t1767~0.offset_14|) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t1767~0.base_17| 1)) (= 0 v_~y$w_buff1~0_35) (= 0 v_~weak$$choice2~0_35) (= v_~main$tmp_guard1~0_14 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1767~0.base_17| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1767~0.base_17|) |v_ULTIMATE.start_main_~#t1767~0.offset_14| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_12 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff1_thd1~0_27) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1767~0.base_17| 4)) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 v_~y$w_buff0~0_36) (= v_~y$r_buff0_thd1~0_54 0) (= 0 v_~x~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1767~0.offset=|v_ULTIMATE.start_main_~#t1767~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_132, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1767~0.base=|v_ULTIMATE.start_main_~#t1767~0.base_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ULTIMATE.start_main_~#t1768~0.offset=|v_ULTIMATE.start_main_~#t1768~0.offset_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, #length=|v_#length_17|, ~y~0=v_~y~0_27, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_~#t1768~0.base=|v_ULTIMATE.start_main_~#t1768~0.base_17|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1767~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ULTIMATE.start_main_~#t1767~0.base, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1768~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1768~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:05:23,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-1-->L812: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1768~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1768~0.base_11|) |v_ULTIMATE.start_main_~#t1768~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1768~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1768~0.offset_10|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1768~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1768~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1768~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1768~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1768~0.offset=|v_ULTIMATE.start_main_~#t1768~0.offset_10|, ULTIMATE.start_main_~#t1768~0.base=|v_ULTIMATE.start_main_~#t1768~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1768~0.offset, ULTIMATE.start_main_~#t1768~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 22:05:23,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= 1 v_~y$w_buff0_used~0_96) (= 1 v_~y$w_buff0~0_21) (= v_~y$w_buff1_used~0_53 v_~y$w_buff0_used~0_97) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= v_~y$w_buff0~0_22 v_~y$w_buff1~0_19) (= (mod v_~y$w_buff1_used~0_53 256) 0)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff0~0=v_~y$w_buff0~0_22, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_19, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_53} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:05:23,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L772-2-->L772-5: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1946396600 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1946396600 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite28_Out1946396600| |P1Thread1of1ForFork1_#t~ite29_Out1946396600|))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out1946396600| ~y$w_buff0~0_In1946396600) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1946396600| ~y$w_buff1~0_In1946396600) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1946396600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1946396600, ~y$w_buff0~0=~y$w_buff0~0_In1946396600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1946396600} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1946396600|, ~y$w_buff1~0=~y$w_buff1~0_In1946396600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1946396600, ~y$w_buff0~0=~y$w_buff0~0_In1946396600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1946396600, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1946396600|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 22:05:23,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L777-->L778: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd2~0_64 v_~y$r_buff0_thd2~0_63)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 22:05:23,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1114910063 256)))) (or (and .cse0 (= ~y~0_In1114910063 |P1Thread1of1ForFork1_#t~ite48_Out1114910063|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out1114910063| ~y$mem_tmp~0_In1114910063)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1114910063, ~y$flush_delayed~0=~y$flush_delayed~0_In1114910063, ~y~0=~y~0_In1114910063} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1114910063, ~y$flush_delayed~0=~y$flush_delayed~0_In1114910063, ~y~0=~y~0_In1114910063, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1114910063|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 22:05:23,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1617656396 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1617656396 |P0Thread1of1ForFork0_#t~ite25_Out-1617656396|)) (and .cse0 (= ~y~0_In-1617656396 |P0Thread1of1ForFork0_#t~ite25_Out-1617656396|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1617656396, ~y$flush_delayed~0=~y$flush_delayed~0_In-1617656396, ~y~0=~y~0_In-1617656396} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1617656396, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1617656396|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1617656396, ~y~0=~y~0_In-1617656396} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 22:05:23,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1878314058 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1878314058 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out1878314058| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out1878314058| ~y$w_buff0_used~0_In1878314058)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1878314058, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1878314058} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1878314058, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1878314058|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1878314058} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 22:05:23,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1462434582 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1462434582 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1462434582 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1462434582 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out-1462434582| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite52_Out-1462434582| ~y$w_buff1_used~0_In-1462434582)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1462434582, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1462434582, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1462434582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1462434582} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1462434582, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1462434582, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-1462434582|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1462434582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1462434582} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 22:05:23,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1062058130 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1062058130 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out1062058130)) (and (= ~y$r_buff0_thd2~0_In1062058130 ~y$r_buff0_thd2~0_Out1062058130) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1062058130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1062058130} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out1062058130|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1062058130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1062058130} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:05:23,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L744-2-->P0EXIT: Formula: (and (= 0 v_~y$flush_delayed~0_12) (= v_~y~0_23 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 22:05:23,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1579346702 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1579346702 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1579346702 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1579346702 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1579346702 |P1Thread1of1ForFork1_#t~ite54_Out-1579346702|)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-1579346702| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1579346702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1579346702, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1579346702, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1579346702} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1579346702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1579346702, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1579346702, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1579346702|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1579346702} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 22:05:23,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_35 |v_P1Thread1of1ForFork1_#t~ite54_8|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:05:23,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L816-->L818-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_109 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:05:23,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1488880323 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1488880323 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out-1488880323| ~y~0_In-1488880323)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite57_Out-1488880323| ~y$w_buff1~0_In-1488880323) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1488880323, ~y~0=~y~0_In-1488880323, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1488880323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1488880323} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1488880323, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1488880323|, ~y~0=~y~0_In-1488880323, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1488880323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1488880323} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 22:05:23,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L818-4-->L819: Formula: (= v_~y~0_22 |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|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-27 22:05:23,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-201623 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-201623 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-201623| ~y$w_buff0_used~0_In-201623)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-201623| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-201623, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-201623} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-201623, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-201623, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-201623|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 22:05:23,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1595412991 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1595412991 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1595412991 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1595412991 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1595412991 |ULTIMATE.start_main_#t~ite60_Out1595412991|)) (and (= |ULTIMATE.start_main_#t~ite60_Out1595412991| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1595412991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1595412991, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1595412991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595412991} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1595412991|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1595412991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1595412991, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1595412991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595412991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 22:05:23,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-645211931 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-645211931 256)))) (or (and (= ~y$r_buff0_thd0~0_In-645211931 |ULTIMATE.start_main_#t~ite61_Out-645211931|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-645211931|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-645211931, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-645211931} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-645211931|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-645211931, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-645211931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 22:05:23,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-64591078 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-64591078 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-64591078 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-64591078 256)))) (or (and (= ~y$r_buff1_thd0~0_In-64591078 |ULTIMATE.start_main_#t~ite62_Out-64591078|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-64591078|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-64591078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-64591078, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-64591078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64591078} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-64591078|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-64591078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-64591078, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-64591078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-64591078} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 22:05:23,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite62_11| v_~y$r_buff1_thd0~0_14) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:05:24,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:05:24 BasicIcfg [2019-12-27 22:05:24,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:05:24,094 INFO L168 Benchmark]: Toolchain (without parser) took 30114.04 ms. Allocated memory was 147.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 103.7 MB in the beginning and 641.0 MB in the end (delta: -537.3 MB). Peak memory consumption was 778.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:24,094 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:05:24,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.22 ms. Allocated memory was 147.8 MB in the beginning and 201.9 MB in the end (delta: 54.0 MB). Free memory was 103.5 MB in the beginning and 154.7 MB in the end (delta: -51.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:24,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.42 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:24,096 INFO L168 Benchmark]: Boogie Preprocessor took 63.57 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 149.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:24,097 INFO L168 Benchmark]: RCFGBuilder took 939.66 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 96.5 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:24,098 INFO L168 Benchmark]: TraceAbstraction took 28204.72 ms. Allocated memory was 201.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 95.9 MB in the beginning and 641.0 MB in the end (delta: -545.1 MB). Peak memory consumption was 716.4 MB. Max. memory is 7.1 GB. [2019-12-27 22:05:24,101 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.26 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.22 ms. Allocated memory was 147.8 MB in the beginning and 201.9 MB in the end (delta: 54.0 MB). Free memory was 103.5 MB in the beginning and 154.7 MB in the end (delta: -51.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.42 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.57 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 149.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 939.66 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 96.5 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28204.72 ms. Allocated memory was 201.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 95.9 MB in the beginning and 641.0 MB in the end (delta: -545.1 MB). Peak memory consumption was 716.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 178 ProgramPointsBefore, 105 ProgramPointsAfterwards, 227 TransitionsBefore, 130 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 27 ChoiceCompositions, 9370 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 128953 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1767, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] FCALL, FORK 0 pthread_create(&t1768, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y 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=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__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=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = 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=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = 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=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y 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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = y 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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L814] 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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2992 SDtfs, 4736 SDslu, 5965 SDs, 0 SdLazy, 3900 SolverSat, 335 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 44 SyntacticMatches, 14 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40275occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 13814 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 618 NumberOfCodeBlocks, 618 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 543 ConstructedInterpolants, 0 QuantifiedInterpolants, 74131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...