/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:13:50,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:13:50,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:13:50,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:13:50,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:13:50,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:13:50,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:13:50,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:13:50,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:13:50,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:13:50,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:13:50,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:13:50,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:13:50,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:13:50,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:13:50,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:13:50,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:13:50,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:13:50,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:13:50,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:13:50,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:13:50,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:13:50,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:13:50,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:13:50,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:13:50,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:13:50,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:13:50,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:13:50,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:13:50,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:13:50,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:13:50,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:13:50,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:13:50,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:13:50,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:13:50,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:13:50,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:13:50,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:13:50,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:13:50,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:13:50,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:13:50,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:13:50,662 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:13:50,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:13:50,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:13:50,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:13:50,666 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:13:50,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:13:50,666 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:13:50,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:13:50,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:13:50,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:13:50,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:13:50,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:13:50,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:13:50,669 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:13:50,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:13:50,669 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:13:50,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:13:50,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:13:50,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:13:50,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:13:50,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:13:50,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:13:50,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:13:50,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:13:50,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:13:50,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:13:50,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:13:50,672 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:13:50,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:13:50,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:13:50,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:13:50,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:13:50,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:13:50,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:13:50,977 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:13:50,978 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i [2019-12-27 07:13:51,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ee9f38f/011505b86a574934ad49bb4ad7970ef5/FLAG2abd7f505 [2019-12-27 07:13:51,581 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:13:51,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i [2019-12-27 07:13:51,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ee9f38f/011505b86a574934ad49bb4ad7970ef5/FLAG2abd7f505 [2019-12-27 07:13:51,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ee9f38f/011505b86a574934ad49bb4ad7970ef5 [2019-12-27 07:13:51,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:13:51,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:13:51,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:13:51,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:13:51,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:13:51,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:13:51" (1/1) ... [2019-12-27 07:13:51,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:51, skipping insertion in model container [2019-12-27 07:13:51,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:13:51" (1/1) ... [2019-12-27 07:13:51,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:13:51,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:13:52,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:13:52,467 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:13:52,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:13:52,632 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:13:52,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52 WrapperNode [2019-12-27 07:13:52,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:13:52,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:13:52,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:13:52,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:13:52,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (1/1) ... [2019-12-27 07:13:52,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (1/1) ... [2019-12-27 07:13:52,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:13:52,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:13:52,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:13:52,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:13:52,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (1/1) ... [2019-12-27 07:13:52,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (1/1) ... [2019-12-27 07:13:52,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (1/1) ... [2019-12-27 07:13:52,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (1/1) ... [2019-12-27 07:13:52,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (1/1) ... [2019-12-27 07:13:52,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (1/1) ... [2019-12-27 07:13:52,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (1/1) ... [2019-12-27 07:13:52,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:13:52,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:13:52,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:13:52,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:13:52,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (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 07:13:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:13:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:13:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:13:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:13:52,826 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:13:52,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:13:52,826 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:13:52,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:13:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:13:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:13:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:13:52,831 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 07:13:53,761 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:13:53,762 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:13:53,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:13:53 BoogieIcfgContainer [2019-12-27 07:13:53,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:13:53,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:13:53,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:13:53,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:13:53,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:13:51" (1/3) ... [2019-12-27 07:13:53,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ad67b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:13:53, skipping insertion in model container [2019-12-27 07:13:53,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:52" (2/3) ... [2019-12-27 07:13:53,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ad67b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:13:53, skipping insertion in model container [2019-12-27 07:13:53,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:13:53" (3/3) ... [2019-12-27 07:13:53,772 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.opt.i [2019-12-27 07:13:53,784 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:13:53,784 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:13:53,793 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:13:53,794 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:13:53,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,855 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,904 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,906 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,913 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:53,933 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:13:53,953 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:13:53,953 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:13:53,954 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:13:53,954 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:13:53,954 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:13:53,954 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:13:53,954 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:13:53,954 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:13:53,972 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-27 07:13:53,974 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 07:13:54,103 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 07:13:54,103 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:13:54,123 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 07:13:54,146 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 07:13:54,204 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 07:13:54,205 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:13:54,214 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 07:13:54,241 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 07:13:54,242 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:13:57,408 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:13:57,682 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:13:57,845 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:13:57,891 INFO L206 etLargeBlockEncoding]: Checked pairs total: 149863 [2019-12-27 07:13:57,891 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 07:13:57,894 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 133 transitions [2019-12-27 07:13:59,568 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27271 states. [2019-12-27 07:13:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27271 states. [2019-12-27 07:13:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:13:59,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:59,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:13:59,578 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:13:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:59,583 INFO L82 PathProgramCache]: Analyzing trace with hash 955890454, now seen corresponding path program 1 times [2019-12-27 07:13:59,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:59,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826347774] [2019-12-27 07:13:59,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:59,854 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 07:13:59,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826347774] [2019-12-27 07:13:59,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:59,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:13:59,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380738281] [2019-12-27 07:13:59,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:13:59,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:59,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:13:59,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:13:59,888 INFO L87 Difference]: Start difference. First operand 27271 states. Second operand 3 states. [2019-12-27 07:14:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:01,254 INFO L93 Difference]: Finished difference Result 26946 states and 96635 transitions. [2019-12-27 07:14:01,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:14:01,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:14:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:01,474 INFO L225 Difference]: With dead ends: 26946 [2019-12-27 07:14:01,474 INFO L226 Difference]: Without dead ends: 25207 [2019-12-27 07:14:01,476 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 07:14:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25207 states. [2019-12-27 07:14:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25207 to 25207. [2019-12-27 07:14:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25207 states. [2019-12-27 07:14:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25207 states to 25207 states and 90336 transitions. [2019-12-27 07:14:02,968 INFO L78 Accepts]: Start accepts. Automaton has 25207 states and 90336 transitions. Word has length 5 [2019-12-27 07:14:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:02,969 INFO L462 AbstractCegarLoop]: Abstraction has 25207 states and 90336 transitions. [2019-12-27 07:14:02,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:14:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 25207 states and 90336 transitions. [2019-12-27 07:14:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:14:02,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:02,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:02,983 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1479335670, now seen corresponding path program 1 times [2019-12-27 07:14:02,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:02,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635106987] [2019-12-27 07:14:02,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:03,083 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 07:14:03,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635106987] [2019-12-27 07:14:03,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:03,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:14:03,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997444892] [2019-12-27 07:14:03,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:14:03,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:03,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:14:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:14:03,086 INFO L87 Difference]: Start difference. First operand 25207 states and 90336 transitions. Second operand 4 states. [2019-12-27 07:14:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:03,843 INFO L93 Difference]: Finished difference Result 38966 states and 133479 transitions. [2019-12-27 07:14:03,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:14:03,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:14:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:03,974 INFO L225 Difference]: With dead ends: 38966 [2019-12-27 07:14:03,974 INFO L226 Difference]: Without dead ends: 38948 [2019-12-27 07:14:03,975 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 07:14:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38948 states. [2019-12-27 07:14:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38948 to 37967. [2019-12-27 07:14:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37967 states. [2019-12-27 07:14:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37967 states to 37967 states and 130916 transitions. [2019-12-27 07:14:06,918 INFO L78 Accepts]: Start accepts. Automaton has 37967 states and 130916 transitions. Word has length 11 [2019-12-27 07:14:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:06,918 INFO L462 AbstractCegarLoop]: Abstraction has 37967 states and 130916 transitions. [2019-12-27 07:14:06,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 37967 states and 130916 transitions. [2019-12-27 07:14:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:14:06,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:06,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:06,923 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:06,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1793441041, now seen corresponding path program 1 times [2019-12-27 07:14:06,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:06,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75450043] [2019-12-27 07:14:06,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:07,049 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 07:14:07,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75450043] [2019-12-27 07:14:07,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:07,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:14:07,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953284202] [2019-12-27 07:14:07,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:14:07,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:07,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:14:07,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:14:07,052 INFO L87 Difference]: Start difference. First operand 37967 states and 130916 transitions. Second operand 4 states. [2019-12-27 07:14:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:07,514 INFO L93 Difference]: Finished difference Result 48754 states and 165257 transitions. [2019-12-27 07:14:07,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:14:07,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:14:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:07,696 INFO L225 Difference]: With dead ends: 48754 [2019-12-27 07:14:07,696 INFO L226 Difference]: Without dead ends: 48739 [2019-12-27 07:14:07,697 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 07:14:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48739 states. [2019-12-27 07:14:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48739 to 43861. [2019-12-27 07:14:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43861 states. [2019-12-27 07:14:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43861 states to 43861 states and 150189 transitions. [2019-12-27 07:14:10,740 INFO L78 Accepts]: Start accepts. Automaton has 43861 states and 150189 transitions. Word has length 14 [2019-12-27 07:14:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:10,742 INFO L462 AbstractCegarLoop]: Abstraction has 43861 states and 150189 transitions. [2019-12-27 07:14:10,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 43861 states and 150189 transitions. [2019-12-27 07:14:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 07:14:10,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:10,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:10,746 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:10,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:10,746 INFO L82 PathProgramCache]: Analyzing trace with hash 237931436, now seen corresponding path program 1 times [2019-12-27 07:14:10,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:10,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754860581] [2019-12-27 07:14:10,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:10,790 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 07:14:10,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754860581] [2019-12-27 07:14:10,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:10,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:14:10,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249511446] [2019-12-27 07:14:10,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:14:10,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:10,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:14:10,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:14:10,794 INFO L87 Difference]: Start difference. First operand 43861 states and 150189 transitions. Second operand 3 states. [2019-12-27 07:14:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:11,117 INFO L93 Difference]: Finished difference Result 71282 states and 233582 transitions. [2019-12-27 07:14:11,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:14:11,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 07:14:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:11,866 INFO L225 Difference]: With dead ends: 71282 [2019-12-27 07:14:11,866 INFO L226 Difference]: Without dead ends: 71282 [2019-12-27 07:14:11,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:14:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71282 states. [2019-12-27 07:14:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71282 to 63620. [2019-12-27 07:14:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63620 states. [2019-12-27 07:14:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63620 states to 63620 states and 211773 transitions. [2019-12-27 07:14:15,183 INFO L78 Accepts]: Start accepts. Automaton has 63620 states and 211773 transitions. Word has length 15 [2019-12-27 07:14:15,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:15,184 INFO L462 AbstractCegarLoop]: Abstraction has 63620 states and 211773 transitions. [2019-12-27 07:14:15,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:14:15,184 INFO L276 IsEmpty]: Start isEmpty. Operand 63620 states and 211773 transitions. [2019-12-27 07:14:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:14:15,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:15,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:15,192 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:15,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:15,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1616735725, now seen corresponding path program 1 times [2019-12-27 07:14:15,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:15,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385290312] [2019-12-27 07:14:15,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:14:15,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385290312] [2019-12-27 07:14:15,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:15,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:14:15,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265838068] [2019-12-27 07:14:15,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:14:15,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:15,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:14:15,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:14:15,252 INFO L87 Difference]: Start difference. First operand 63620 states and 211773 transitions. Second operand 3 states. [2019-12-27 07:14:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:15,950 INFO L93 Difference]: Finished difference Result 63517 states and 211446 transitions. [2019-12-27 07:14:15,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:14:15,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:14:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:16,111 INFO L225 Difference]: With dead ends: 63517 [2019-12-27 07:14:16,111 INFO L226 Difference]: Without dead ends: 63517 [2019-12-27 07:14:16,112 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 07:14:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63517 states. [2019-12-27 07:14:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63517 to 63517. [2019-12-27 07:14:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63517 states. [2019-12-27 07:14:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63517 states to 63517 states and 211446 transitions. [2019-12-27 07:14:19,555 INFO L78 Accepts]: Start accepts. Automaton has 63517 states and 211446 transitions. Word has length 16 [2019-12-27 07:14:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:19,556 INFO L462 AbstractCegarLoop]: Abstraction has 63517 states and 211446 transitions. [2019-12-27 07:14:19,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:14:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 63517 states and 211446 transitions. [2019-12-27 07:14:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:14:19,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:19,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:19,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:19,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1032158122, now seen corresponding path program 1 times [2019-12-27 07:14:19,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:19,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104919577] [2019-12-27 07:14:19,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:19,636 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 07:14:19,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104919577] [2019-12-27 07:14:19,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:19,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:14:19,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209293391] [2019-12-27 07:14:19,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:14:19,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:14:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:14:19,638 INFO L87 Difference]: Start difference. First operand 63517 states and 211446 transitions. Second operand 4 states. [2019-12-27 07:14:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:20,229 INFO L93 Difference]: Finished difference Result 77880 states and 255480 transitions. [2019-12-27 07:14:20,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:14:20,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:14:20,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:20,396 INFO L225 Difference]: With dead ends: 77880 [2019-12-27 07:14:20,396 INFO L226 Difference]: Without dead ends: 77863 [2019-12-27 07:14:20,396 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 07:14:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77863 states. [2019-12-27 07:14:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77863 to 64071. [2019-12-27 07:14:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64071 states. [2019-12-27 07:14:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64071 states to 64071 states and 213322 transitions. [2019-12-27 07:14:24,856 INFO L78 Accepts]: Start accepts. Automaton has 64071 states and 213322 transitions. Word has length 17 [2019-12-27 07:14:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:24,856 INFO L462 AbstractCegarLoop]: Abstraction has 64071 states and 213322 transitions. [2019-12-27 07:14:24,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 64071 states and 213322 transitions. [2019-12-27 07:14:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:14:24,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:24,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:24,863 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:24,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:24,864 INFO L82 PathProgramCache]: Analyzing trace with hash 274413131, now seen corresponding path program 1 times [2019-12-27 07:14:24,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:24,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610844525] [2019-12-27 07:14:24,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:24,912 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 07:14:24,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610844525] [2019-12-27 07:14:24,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:24,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:14:24,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707083773] [2019-12-27 07:14:24,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:14:24,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:14:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:14:24,915 INFO L87 Difference]: Start difference. First operand 64071 states and 213322 transitions. Second operand 3 states. [2019-12-27 07:14:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:25,150 INFO L93 Difference]: Finished difference Result 60500 states and 201181 transitions. [2019-12-27 07:14:25,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:14:25,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 07:14:25,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:25,268 INFO L225 Difference]: With dead ends: 60500 [2019-12-27 07:14:25,268 INFO L226 Difference]: Without dead ends: 60374 [2019-12-27 07:14:25,269 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 07:14:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60374 states. [2019-12-27 07:14:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60374 to 60374. [2019-12-27 07:14:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60374 states. [2019-12-27 07:14:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60374 states to 60374 states and 200794 transitions. [2019-12-27 07:14:26,926 INFO L78 Accepts]: Start accepts. Automaton has 60374 states and 200794 transitions. Word has length 17 [2019-12-27 07:14:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:26,926 INFO L462 AbstractCegarLoop]: Abstraction has 60374 states and 200794 transitions. [2019-12-27 07:14:26,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:14:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 60374 states and 200794 transitions. [2019-12-27 07:14:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 07:14:26,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:26,935 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 07:14:26,935 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:26,936 INFO L82 PathProgramCache]: Analyzing trace with hash 363158557, now seen corresponding path program 1 times [2019-12-27 07:14:26,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:26,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808126740] [2019-12-27 07:14:26,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:26,994 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 07:14:26,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808126740] [2019-12-27 07:14:26,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:26,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:14:26,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605409710] [2019-12-27 07:14:26,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:14:26,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:26,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:14:26,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:14:26,997 INFO L87 Difference]: Start difference. First operand 60374 states and 200794 transitions. Second operand 5 states. [2019-12-27 07:14:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:27,968 INFO L93 Difference]: Finished difference Result 84981 states and 275357 transitions. [2019-12-27 07:14:27,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:14:27,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 07:14:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:28,141 INFO L225 Difference]: With dead ends: 84981 [2019-12-27 07:14:28,141 INFO L226 Difference]: Without dead ends: 84967 [2019-12-27 07:14:28,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:14:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84967 states. [2019-12-27 07:14:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84967 to 65930. [2019-12-27 07:14:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65930 states. [2019-12-27 07:14:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65930 states to 65930 states and 218108 transitions. [2019-12-27 07:14:33,543 INFO L78 Accepts]: Start accepts. Automaton has 65930 states and 218108 transitions. Word has length 20 [2019-12-27 07:14:33,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:33,544 INFO L462 AbstractCegarLoop]: Abstraction has 65930 states and 218108 transitions. [2019-12-27 07:14:33,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:14:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 65930 states and 218108 transitions. [2019-12-27 07:14:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 07:14:33,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:33,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:33,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:33,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1131596126, now seen corresponding path program 1 times [2019-12-27 07:14:33,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:33,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867722613] [2019-12-27 07:14:33,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:33,628 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 07:14:33,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867722613] [2019-12-27 07:14:33,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:33,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:14:33,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105103627] [2019-12-27 07:14:33,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:14:33,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:33,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:14:33,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:14:33,633 INFO L87 Difference]: Start difference. First operand 65930 states and 218108 transitions. Second operand 5 states. [2019-12-27 07:14:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:34,536 INFO L93 Difference]: Finished difference Result 89060 states and 288103 transitions. [2019-12-27 07:14:34,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:14:34,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 07:14:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:34,709 INFO L225 Difference]: With dead ends: 89060 [2019-12-27 07:14:34,709 INFO L226 Difference]: Without dead ends: 89032 [2019-12-27 07:14:34,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:14:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89032 states. [2019-12-27 07:14:36,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89032 to 61456. [2019-12-27 07:14:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61456 states. [2019-12-27 07:14:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61456 states to 61456 states and 203832 transitions. [2019-12-27 07:14:36,667 INFO L78 Accepts]: Start accepts. Automaton has 61456 states and 203832 transitions. Word has length 23 [2019-12-27 07:14:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:36,668 INFO L462 AbstractCegarLoop]: Abstraction has 61456 states and 203832 transitions. [2019-12-27 07:14:36,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:14:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 61456 states and 203832 transitions. [2019-12-27 07:14:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 07:14:36,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:36,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:36,725 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:36,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:36,726 INFO L82 PathProgramCache]: Analyzing trace with hash -936804425, now seen corresponding path program 1 times [2019-12-27 07:14:36,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:36,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131154921] [2019-12-27 07:14:36,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:36,789 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 07:14:36,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131154921] [2019-12-27 07:14:36,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:36,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:14:36,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691150429] [2019-12-27 07:14:36,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:14:36,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:36,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:14:36,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:14:36,792 INFO L87 Difference]: Start difference. First operand 61456 states and 203832 transitions. Second operand 3 states. [2019-12-27 07:14:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:37,137 INFO L93 Difference]: Finished difference Result 57816 states and 188658 transitions. [2019-12-27 07:14:37,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:14:37,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 07:14:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:37,290 INFO L225 Difference]: With dead ends: 57816 [2019-12-27 07:14:37,291 INFO L226 Difference]: Without dead ends: 57816 [2019-12-27 07:14:37,291 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 07:14:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57816 states. [2019-12-27 07:14:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57816 to 57580. [2019-12-27 07:14:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57580 states. [2019-12-27 07:14:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57580 states to 57580 states and 187992 transitions. [2019-12-27 07:14:39,074 INFO L78 Accepts]: Start accepts. Automaton has 57580 states and 187992 transitions. Word has length 31 [2019-12-27 07:14:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:39,074 INFO L462 AbstractCegarLoop]: Abstraction has 57580 states and 187992 transitions. [2019-12-27 07:14:39,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:14:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 57580 states and 187992 transitions. [2019-12-27 07:14:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:39,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:39,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:39,120 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:39,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:39,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1732188204, now seen corresponding path program 1 times [2019-12-27 07:14:39,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:39,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002240194] [2019-12-27 07:14:39,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:39,251 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 07:14:39,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002240194] [2019-12-27 07:14:39,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:39,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:14:39,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991289470] [2019-12-27 07:14:39,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:14:39,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:39,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:14:39,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:14:39,253 INFO L87 Difference]: Start difference. First operand 57580 states and 187992 transitions. Second operand 10 states. [2019-12-27 07:14:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:41,871 INFO L93 Difference]: Finished difference Result 142970 states and 467161 transitions. [2019-12-27 07:14:41,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:14:41,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-27 07:14:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:42,111 INFO L225 Difference]: With dead ends: 142970 [2019-12-27 07:14:42,111 INFO L226 Difference]: Without dead ends: 117958 [2019-12-27 07:14:42,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-12-27 07:14:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117958 states. [2019-12-27 07:14:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117958 to 92250. [2019-12-27 07:14:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92250 states. [2019-12-27 07:14:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92250 states to 92250 states and 304217 transitions. [2019-12-27 07:14:44,842 INFO L78 Accepts]: Start accepts. Automaton has 92250 states and 304217 transitions. Word has length 32 [2019-12-27 07:14:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:44,842 INFO L462 AbstractCegarLoop]: Abstraction has 92250 states and 304217 transitions. [2019-12-27 07:14:44,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:14:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 92250 states and 304217 transitions. [2019-12-27 07:14:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:44,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:44,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:44,941 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1881248646, now seen corresponding path program 2 times [2019-12-27 07:14:44,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:44,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975443038] [2019-12-27 07:14:44,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:45,014 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 07:14:45,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975443038] [2019-12-27 07:14:45,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:45,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:14:45,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860909844] [2019-12-27 07:14:45,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:14:45,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:14:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:14:45,016 INFO L87 Difference]: Start difference. First operand 92250 states and 304217 transitions. Second operand 7 states. [2019-12-27 07:14:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:46,248 INFO L93 Difference]: Finished difference Result 144439 states and 473504 transitions. [2019-12-27 07:14:46,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:14:46,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 07:14:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:47,410 INFO L225 Difference]: With dead ends: 144439 [2019-12-27 07:14:47,410 INFO L226 Difference]: Without dead ends: 130093 [2019-12-27 07:14:47,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:14:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130093 states. [2019-12-27 07:14:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130093 to 93446. [2019-12-27 07:14:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93446 states. [2019-12-27 07:14:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93446 states to 93446 states and 307728 transitions. [2019-12-27 07:14:50,580 INFO L78 Accepts]: Start accepts. Automaton has 93446 states and 307728 transitions. Word has length 32 [2019-12-27 07:14:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:50,580 INFO L462 AbstractCegarLoop]: Abstraction has 93446 states and 307728 transitions. [2019-12-27 07:14:50,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:14:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 93446 states and 307728 transitions. [2019-12-27 07:14:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:50,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:50,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:50,665 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:50,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash 597590804, now seen corresponding path program 3 times [2019-12-27 07:14:50,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:50,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858629834] [2019-12-27 07:14:50,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:50,744 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 07:14:50,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858629834] [2019-12-27 07:14:50,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:50,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:14:50,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051778195] [2019-12-27 07:14:50,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:14:50,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:50,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:14:50,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:14:50,747 INFO L87 Difference]: Start difference. First operand 93446 states and 307728 transitions. Second operand 7 states. [2019-12-27 07:14:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:52,118 INFO L93 Difference]: Finished difference Result 166163 states and 550261 transitions. [2019-12-27 07:14:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:14:52,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 07:14:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:52,446 INFO L225 Difference]: With dead ends: 166163 [2019-12-27 07:14:52,446 INFO L226 Difference]: Without dead ends: 158223 [2019-12-27 07:14:52,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:14:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158223 states. [2019-12-27 07:14:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158223 to 93476. [2019-12-27 07:14:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93476 states. [2019-12-27 07:14:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93476 states to 93476 states and 307847 transitions. [2019-12-27 07:14:57,339 INFO L78 Accepts]: Start accepts. Automaton has 93476 states and 307847 transitions. Word has length 32 [2019-12-27 07:14:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:57,339 INFO L462 AbstractCegarLoop]: Abstraction has 93476 states and 307847 transitions. [2019-12-27 07:14:57,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:14:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 93476 states and 307847 transitions. [2019-12-27 07:14:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:57,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:57,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:57,423 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:57,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1306987540, now seen corresponding path program 4 times [2019-12-27 07:14:57,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:57,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468461602] [2019-12-27 07:14:57,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:57,587 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 07:14:57,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468461602] [2019-12-27 07:14:57,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:57,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:14:57,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955941518] [2019-12-27 07:14:57,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:14:57,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:57,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:14:57,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:14:57,589 INFO L87 Difference]: Start difference. First operand 93476 states and 307847 transitions. Second operand 10 states. [2019-12-27 07:15:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:15:02,610 INFO L93 Difference]: Finished difference Result 147466 states and 485559 transitions. [2019-12-27 07:15:02,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:15:02,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-27 07:15:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:15:02,920 INFO L225 Difference]: With dead ends: 147466 [2019-12-27 07:15:02,921 INFO L226 Difference]: Without dead ends: 140266 [2019-12-27 07:15:02,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-12-27 07:15:03,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140266 states. [2019-12-27 07:15:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140266 to 94193. [2019-12-27 07:15:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94193 states. [2019-12-27 07:15:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94193 states to 94193 states and 310106 transitions. [2019-12-27 07:15:05,512 INFO L78 Accepts]: Start accepts. Automaton has 94193 states and 310106 transitions. Word has length 32 [2019-12-27 07:15:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:15:05,513 INFO L462 AbstractCegarLoop]: Abstraction has 94193 states and 310106 transitions. [2019-12-27 07:15:05,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:15:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 94193 states and 310106 transitions. [2019-12-27 07:15:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:15:05,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:15:05,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:15:05,596 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:15:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:15:05,596 INFO L82 PathProgramCache]: Analyzing trace with hash -790939130, now seen corresponding path program 5 times [2019-12-27 07:15:05,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:15:05,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417473413] [2019-12-27 07:15:05,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:15:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:15:05,666 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 07:15:05,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417473413] [2019-12-27 07:15:05,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:15:05,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:15:05,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511240889] [2019-12-27 07:15:05,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:15:05,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:15:05,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:15:05,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:15:05,668 INFO L87 Difference]: Start difference. First operand 94193 states and 310106 transitions. Second operand 7 states. [2019-12-27 07:15:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:15:07,727 INFO L93 Difference]: Finished difference Result 151275 states and 500126 transitions. [2019-12-27 07:15:07,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:15:07,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 07:15:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:15:08,028 INFO L225 Difference]: With dead ends: 151275 [2019-12-27 07:15:08,028 INFO L226 Difference]: Without dead ends: 144255 [2019-12-27 07:15:08,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:15:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144255 states. [2019-12-27 07:15:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144255 to 93887. [2019-12-27 07:15:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93887 states. [2019-12-27 07:15:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93887 states to 93887 states and 309033 transitions. [2019-12-27 07:15:13,881 INFO L78 Accepts]: Start accepts. Automaton has 93887 states and 309033 transitions. Word has length 32 [2019-12-27 07:15:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:15:13,881 INFO L462 AbstractCegarLoop]: Abstraction has 93887 states and 309033 transitions. [2019-12-27 07:15:13,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:15:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 93887 states and 309033 transitions. [2019-12-27 07:15:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:15:13,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:15:13,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:15:13,971 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:15:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:15:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash 4490691, now seen corresponding path program 1 times [2019-12-27 07:15:13,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:15:13,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262234646] [2019-12-27 07:15:13,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:15:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:15:14,578 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 07:15:14,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262234646] [2019-12-27 07:15:14,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:15:14,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:15:14,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842693773] [2019-12-27 07:15:14,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:15:14,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:15:14,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:15:14,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:15:14,580 INFO L87 Difference]: Start difference. First operand 93887 states and 309033 transitions. Second operand 4 states. [2019-12-27 07:15:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:15:14,649 INFO L93 Difference]: Finished difference Result 13178 states and 36455 transitions. [2019-12-27 07:15:14,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:15:14,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 07:15:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:15:14,660 INFO L225 Difference]: With dead ends: 13178 [2019-12-27 07:15:14,660 INFO L226 Difference]: Without dead ends: 7848 [2019-12-27 07:15:14,661 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 07:15:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2019-12-27 07:15:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 7609. [2019-12-27 07:15:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7609 states. [2019-12-27 07:15:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7609 states to 7609 states and 18012 transitions. [2019-12-27 07:15:14,743 INFO L78 Accepts]: Start accepts. Automaton has 7609 states and 18012 transitions. Word has length 33 [2019-12-27 07:15:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:15:14,743 INFO L462 AbstractCegarLoop]: Abstraction has 7609 states and 18012 transitions. [2019-12-27 07:15:14,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:15:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 7609 states and 18012 transitions. [2019-12-27 07:15:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 07:15:14,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:15:14,749 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] [2019-12-27 07:15:14,749 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:15:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:15:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2021850497, now seen corresponding path program 1 times [2019-12-27 07:15:14,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:15:14,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444865499] [2019-12-27 07:15:14,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:15:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:15:14,801 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 07:15:14,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444865499] [2019-12-27 07:15:14,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:15:14,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:15:14,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735350380] [2019-12-27 07:15:14,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:15:14,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:15:14,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:15:14,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:15:14,803 INFO L87 Difference]: Start difference. First operand 7609 states and 18012 transitions. Second operand 4 states. [2019-12-27 07:15:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:15:14,842 INFO L93 Difference]: Finished difference Result 8621 states and 20290 transitions. [2019-12-27 07:15:14,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:15:14,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-27 07:15:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:15:14,852 INFO L225 Difference]: With dead ends: 8621 [2019-12-27 07:15:14,852 INFO L226 Difference]: Without dead ends: 6818 [2019-12-27 07:15:14,852 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 07:15:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2019-12-27 07:15:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 6798. [2019-12-27 07:15:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6798 states. [2019-12-27 07:15:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6798 states to 6798 states and 16073 transitions. [2019-12-27 07:15:14,931 INFO L78 Accepts]: Start accepts. Automaton has 6798 states and 16073 transitions. Word has length 44 [2019-12-27 07:15:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:15:14,931 INFO L462 AbstractCegarLoop]: Abstraction has 6798 states and 16073 transitions. [2019-12-27 07:15:14,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:15:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6798 states and 16073 transitions. [2019-12-27 07:15:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 07:15:14,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:15:14,939 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] [2019-12-27 07:15:14,940 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:15:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:15:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1006962917, now seen corresponding path program 2 times [2019-12-27 07:15:14,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:15:14,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712362837] [2019-12-27 07:15:14,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:15:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:15:15,043 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 07:15:15,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712362837] [2019-12-27 07:15:15,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:15:15,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:15:15,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391024644] [2019-12-27 07:15:15,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:15:15,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:15:15,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:15:15,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:15:15,045 INFO L87 Difference]: Start difference. First operand 6798 states and 16073 transitions. Second operand 5 states. [2019-12-27 07:15:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:15:15,111 INFO L93 Difference]: Finished difference Result 4999 states and 12006 transitions. [2019-12-27 07:15:15,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:15:15,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 07:15:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:15:15,112 INFO L225 Difference]: With dead ends: 4999 [2019-12-27 07:15:15,112 INFO L226 Difference]: Without dead ends: 529 [2019-12-27 07:15:15,113 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 07:15:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-27 07:15:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-12-27 07:15:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-27 07:15:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1146 transitions. [2019-12-27 07:15:15,120 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1146 transitions. Word has length 44 [2019-12-27 07:15:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:15:15,120 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1146 transitions. [2019-12-27 07:15:15,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:15:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1146 transitions. [2019-12-27 07:15:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:15:15,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:15:15,122 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 07:15:15,122 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:15:15,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:15:15,122 INFO L82 PathProgramCache]: Analyzing trace with hash -234128232, now seen corresponding path program 1 times [2019-12-27 07:15:15,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:15:15,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600939835] [2019-12-27 07:15:15,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:15:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:15:15,246 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 07:15:15,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600939835] [2019-12-27 07:15:15,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:15:15,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:15:15,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570594789] [2019-12-27 07:15:15,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:15:15,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:15:15,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:15:15,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:15:15,248 INFO L87 Difference]: Start difference. First operand 529 states and 1146 transitions. Second operand 8 states. [2019-12-27 07:15:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:15:15,475 INFO L93 Difference]: Finished difference Result 1082 states and 2315 transitions. [2019-12-27 07:15:15,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:15:15,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-27 07:15:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:15:15,477 INFO L225 Difference]: With dead ends: 1082 [2019-12-27 07:15:15,477 INFO L226 Difference]: Without dead ends: 759 [2019-12-27 07:15:15,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:15:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-27 07:15:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 605. [2019-12-27 07:15:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 07:15:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1277 transitions. [2019-12-27 07:15:15,491 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1277 transitions. Word has length 60 [2019-12-27 07:15:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:15:15,492 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1277 transitions. [2019-12-27 07:15:15,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:15:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1277 transitions. [2019-12-27 07:15:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:15:15,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:15:15,494 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 07:15:15,495 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:15:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:15:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash 663982360, now seen corresponding path program 2 times [2019-12-27 07:15:15,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:15:15,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175562136] [2019-12-27 07:15:15,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:15:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:15:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:15:15,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:15:15,661 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:15:15,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$r_buff1_thd2~0_36) (= 0 v_~weak$$choice0~0_10) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_21|)) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_21| 1)) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~main$tmp_guard0~0_12 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$r_buff1_thd0~0_22) (= v_~y$mem_tmp~0_13 0) (= 0 v_~x~0_9) (= 0 v_~y$flush_delayed~0_18) (= v_~y$w_buff0_used~0_130 0) (= v_~y$r_buff0_thd2~0_75 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1731~0.base_21| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= v_~y~0_32 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1731~0.base_21|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$w_buff1~0_32) (= 0 v_~__unbuffered_p0_EAX~0_16) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1731~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1731~0.base_21|) |v_ULTIMATE.start_main_~#t1731~0.offset_17| 0)) |v_#memory_int_15|) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t1731~0.offset_17|) (= 0 v_~y$r_buff1_thd1~0_27) (= v_~y$w_buff1_used~0_64 0) (= v_~__unbuffered_p0_EBX~0_17 0) (= 0 v_~y$w_buff0~0_35) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_18|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t1731~0.offset=|v_ULTIMATE.start_main_~#t1731~0.offset_17|, ULTIMATE.start_main_~#t1731~0.base=|v_ULTIMATE.start_main_~#t1731~0.base_21|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_17|, ~y~0=v_~y~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_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_12, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_12|, 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_32, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_75, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_9, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1731~0.offset, ULTIMATE.start_main_~#t1731~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, 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, ULTIMATE.start_main_~#t1732~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:15:15,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L813-1-->L815: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1732~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1732~0.base_13|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1732~0.base_13| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13|) |v_ULTIMATE.start_main_~#t1732~0.offset_11| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1732~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1732~0.offset] because there is no mapped edge [2019-12-27 07:15:15,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 1 v_~y$w_buff0_used~0_98) (= 1 v_~y$w_buff0~0_22) (= v_~y$w_buff1_used~0_53 v_~y$w_buff0_used~0_99) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= |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_23 v_~y$w_buff1~0_24) (= (mod v_~y$w_buff1_used~0_53 256) 0)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_23, 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_98, ~y$w_buff1~0=v_~y$w_buff1~0_24, 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_22, 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 07:15:15,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1483815908 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1483815908 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-1483815908 |P1Thread1of1ForFork1_#t~ite28_Out-1483815908|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1483815908| ~y$w_buff1~0_In-1483815908)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1483815908, ~y$w_buff1~0=~y$w_buff1~0_In-1483815908, ~y$w_buff0~0=~y$w_buff0~0_In-1483815908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1483815908} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1483815908, ~y$w_buff1~0=~y$w_buff1~0_In-1483815908, ~y$w_buff0~0=~y$w_buff0~0_In-1483815908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1483815908, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1483815908|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 07:15:15,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_22 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~y~0=v_~y~0_22, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 07:15:15,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff0_thd2~0_52) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} 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 07:15:15,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1071127252 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1071127252 |P1Thread1of1ForFork1_#t~ite48_Out-1071127252|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out-1071127252| ~y~0_In-1071127252)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1071127252, ~y$flush_delayed~0=~y$flush_delayed~0_In-1071127252, ~y~0=~y~0_In-1071127252} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1071127252, ~y$flush_delayed~0=~y$flush_delayed~0_In-1071127252, ~y~0=~y~0_In-1071127252, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1071127252|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 07:15:15,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In237120079 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In237120079 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out237120079|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In237120079 |P1Thread1of1ForFork1_#t~ite51_Out237120079|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In237120079, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In237120079} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In237120079, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out237120079|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In237120079} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 07:15:15,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-32282866 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-32282866 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-32282866 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-32282866 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-32282866|)) (and (= ~y$w_buff1_used~0_In-32282866 |P1Thread1of1ForFork1_#t~ite52_Out-32282866|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-32282866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-32282866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-32282866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-32282866} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-32282866, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-32282866, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-32282866|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-32282866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-32282866} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 07:15:15,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-376167361 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-376167361 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-376167361 ~y$r_buff0_thd2~0_In-376167361)) (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-376167361 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-376167361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-376167361} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-376167361|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-376167361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-376167361} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:15:15,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In724234691 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In724234691 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In724234691 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In724234691 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out724234691| 0)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In724234691 |P1Thread1of1ForFork1_#t~ite54_Out724234691|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In724234691, ~y$w_buff0_used~0=~y$w_buff0_used~0_In724234691, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In724234691, ~y$w_buff1_used~0=~y$w_buff1_used~0_In724234691} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In724234691, ~y$w_buff0_used~0=~y$w_buff0_used~0_In724234691, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In724234691, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out724234691|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In724234691} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 07:15:15,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_31 |v_P1Thread1of1ForFork1_#t~ite54_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, 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 07:15:15,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1084861895 256)))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out1084861895| ~y~0_In1084861895)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out1084861895| ~y$mem_tmp~0_In1084861895)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1084861895, ~y$flush_delayed~0=~y$flush_delayed~0_In1084861895, ~y~0=~y~0_In1084861895} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1084861895, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1084861895|, ~y$flush_delayed~0=~y$flush_delayed~0_In1084861895, ~y~0=~y~0_In1084861895} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 07:15:15,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L747-2-->P0EXIT: Formula: (and (= 0 v_~y$flush_delayed~0_12) (= v_~y~0_26 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} 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_10, ~y~0=v_~y~0_26} 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 07:15:15,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= (mod v_~y$w_buff0_used~0_106 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~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_106, ~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 07:15:15,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1057975679 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1057975679 256)))) (or (and (= ~y~0_In1057975679 |ULTIMATE.start_main_#t~ite57_Out1057975679|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1057975679 |ULTIMATE.start_main_#t~ite57_Out1057975679|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1057975679, ~y~0=~y~0_In1057975679, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1057975679, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057975679} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1057975679, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1057975679|, ~y~0=~y~0_In1057975679, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1057975679, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1057975679} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 07:15:15,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_19 |v_ULTIMATE.start_main_#t~ite57_7|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_7|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_6|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_6|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-27 07:15:15,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2069062460 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2069062460 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2069062460 |ULTIMATE.start_main_#t~ite59_Out-2069062460|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite59_Out-2069062460|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2069062460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2069062460} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2069062460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2069062460, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2069062460|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 07:15:15,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1135510122 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1135510122 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1135510122 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1135510122 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite60_Out1135510122|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1135510122 |ULTIMATE.start_main_#t~ite60_Out1135510122|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1135510122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1135510122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1135510122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1135510122} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1135510122|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1135510122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1135510122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1135510122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1135510122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 07:15:15,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1884902540 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1884902540 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1884902540 |ULTIMATE.start_main_#t~ite61_Out1884902540|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out1884902540|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1884902540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884902540} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1884902540|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1884902540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1884902540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 07:15:15,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1131692155 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1131692155 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1131692155 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1131692155 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1131692155| ~y$r_buff1_thd0~0_In-1131692155) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-1131692155|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131692155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1131692155, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1131692155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1131692155} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1131692155|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131692155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1131692155, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1131692155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1131692155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 07:15:15,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite62_13| v_~y$r_buff1_thd0~0_14) (= 1 v_~__unbuffered_p1_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p1_EBX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~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_8|} 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 07:15:15,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:15:15 BasicIcfg [2019-12-27 07:15:15,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:15:15,839 INFO L168 Benchmark]: Toolchain (without parser) took 83965.43 ms. Allocated memory was 145.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 07:15:15,840 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:15:15,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.40 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 153.5 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:15:15,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.30 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:15:15,844 INFO L168 Benchmark]: Boogie Preprocessor took 40.27 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:15:15,844 INFO L168 Benchmark]: RCFGBuilder took 1025.90 ms. Allocated memory is still 202.4 MB. Free memory was 148.1 MB in the beginning and 95.1 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:15:15,848 INFO L168 Benchmark]: TraceAbstraction took 82072.55 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 94.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 07:15:15,855 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.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.40 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 153.5 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.30 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.27 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1025.90 ms. Allocated memory is still 202.4 MB. Free memory was 148.1 MB in the beginning and 95.1 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 82072.55 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 94.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 179 ProgramPointsBefore, 108 ProgramPointsAfterwards, 228 TransitionsBefore, 133 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 27 ChoiceCompositions, 8765 VarBasedMoverChecksPositive, 227 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 149863 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1731, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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] [L815] FCALL, FORK 0 pthread_create(&t1732, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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 || !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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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_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)) [L777] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L777] 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)) [L778] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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$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)) [L779] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L779] 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)) [L781] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L790] 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_p0_EBX=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] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L739] 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) [L740] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 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)) [L741] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 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)) [L742] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=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=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 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)) [L743] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 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)) [L744] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 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)) [L745] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 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)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=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=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 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, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 81.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5181 SDtfs, 6730 SDslu, 11683 SDs, 0 SdLazy, 5269 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94193occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 298118 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 51812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...