/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_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:13:14,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:13:14,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:13:14,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:13:14,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:13:14,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:13:14,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:13:14,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:13:14,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:13:14,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:13:14,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:13:14,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:13:14,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:13:14,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:13:14,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:13:14,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:13:14,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:13:14,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:13:14,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:13:14,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:13:14,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:13:14,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:13:14,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:13:14,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:13:14,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:13:14,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:13:14,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:13:14,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:13:14,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:13:14,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:13:14,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:13:14,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:13:14,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:13:14,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:13:14,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:13:14,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:13:14,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:13:14,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:13:14,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:13:14,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:13:14,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:13:14,780 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:14,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:13:14,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:13:14,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:13:14,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:13:14,815 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:13:14,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:13:14,816 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:13:14,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:13:14,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:13:14,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:13:14,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:13:14,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:13:14,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:13:14,817 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:13:14,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:13:14,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:13:14,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:13:14,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:13:14,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:13:14,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:13:14,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:13:14,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:13:14,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:13:14,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:13:14,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:13:14,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:13:14,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:13:14,824 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:13:14,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:13:14,824 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:13:15,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:13:15,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:13:15,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:13:15,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:13:15,114 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:13:15,115 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-27 07:13:15,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49eac625e/0892a89d8af042ed9fb64b4e9004c8c4/FLAG98801822c [2019-12-27 07:13:15,734 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:13:15,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-27 07:13:15,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49eac625e/0892a89d8af042ed9fb64b4e9004c8c4/FLAG98801822c [2019-12-27 07:13:16,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49eac625e/0892a89d8af042ed9fb64b4e9004c8c4 [2019-12-27 07:13:16,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:13:16,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:13:16,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:13:16,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:13:16,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:13:16,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:13:16" (1/1) ... [2019-12-27 07:13:16,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23fa2683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:16, skipping insertion in model container [2019-12-27 07:13:16,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:13:16" (1/1) ... [2019-12-27 07:13:16,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:13:16,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:13:16,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:13:16,674 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:13:16,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:13:16,826 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:13:16,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:16 WrapperNode [2019-12-27 07:13:16,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:13:16,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:13:16,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:13:16,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:13:16,837 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:16" (1/1) ... [2019-12-27 07:13:16,863 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:16" (1/1) ... [2019-12-27 07:13:16,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:13:16,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:13:16,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:13:16,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:13:16,908 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:16" (1/1) ... [2019-12-27 07:13:16,908 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:16" (1/1) ... [2019-12-27 07:13:16,913 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:16" (1/1) ... [2019-12-27 07:13:16,914 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:16" (1/1) ... [2019-12-27 07:13:16,925 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:16" (1/1) ... [2019-12-27 07:13:16,929 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:16" (1/1) ... [2019-12-27 07:13:16,933 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:16" (1/1) ... [2019-12-27 07:13:16,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:13:16,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:13:16,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:13:16,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:13:16,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:16" (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:17,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:13:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:13:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:13:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:13:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:13:17,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:13:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:13:17,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:13:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:13:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:13:17,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:13:17,055 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:17,928 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:13:17,928 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:13:17,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:13:17 BoogieIcfgContainer [2019-12-27 07:13:17,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:13:17,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:13:17,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:13:17,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:13:17,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:13:16" (1/3) ... [2019-12-27 07:13:17,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649ed80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:13:17, skipping insertion in model container [2019-12-27 07:13:17,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:16" (2/3) ... [2019-12-27 07:13:17,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649ed80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:13:17, skipping insertion in model container [2019-12-27 07:13:17,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:13:17" (3/3) ... [2019-12-27 07:13:17,938 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.opt.i [2019-12-27 07:13:17,947 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:13:17,947 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:13:17,955 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:13:17,956 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:13:18,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,036 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:18,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,037 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,037 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,064 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,076 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,077 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,078 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:18,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,080 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:18,099 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:13:18,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:13:18,118 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:13:18,118 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:13:18,118 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:13:18,119 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:13:18,119 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:13:18,119 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:13:18,119 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:13:18,136 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-27 07:13:18,138 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 07:13:18,254 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 07:13:18,255 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:13:18,278 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:18,306 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 07:13:18,367 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 07:13:18,367 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:13:18,377 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:18,404 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 07:13:18,405 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:13:21,363 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:13:21,466 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:13:21,760 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:13:21,871 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:13:21,901 INFO L206 etLargeBlockEncoding]: Checked pairs total: 149863 [2019-12-27 07:13:21,901 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 07:13:21,905 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 133 transitions [2019-12-27 07:13:23,491 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27271 states. [2019-12-27 07:13:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 27271 states. [2019-12-27 07:13:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:13:23,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:23,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:13:23,500 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:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:23,505 INFO L82 PathProgramCache]: Analyzing trace with hash 955890454, now seen corresponding path program 1 times [2019-12-27 07:13:23,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:23,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82239976] [2019-12-27 07:13:23,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:23,747 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:23,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82239976] [2019-12-27 07:13:23,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:23,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:13:23,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749569038] [2019-12-27 07:13:23,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:13:23,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:13:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:13:23,775 INFO L87 Difference]: Start difference. First operand 27271 states. Second operand 3 states. [2019-12-27 07:13:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:24,810 INFO L93 Difference]: Finished difference Result 26946 states and 96635 transitions. [2019-12-27 07:13:24,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:13:24,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:13:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:25,060 INFO L225 Difference]: With dead ends: 26946 [2019-12-27 07:13:25,060 INFO L226 Difference]: Without dead ends: 25207 [2019-12-27 07:13:25,062 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:13:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25207 states. [2019-12-27 07:13:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25207 to 25207. [2019-12-27 07:13:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25207 states. [2019-12-27 07:13:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25207 states to 25207 states and 90336 transitions. [2019-12-27 07:13:26,658 INFO L78 Accepts]: Start accepts. Automaton has 25207 states and 90336 transitions. Word has length 5 [2019-12-27 07:13:26,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:26,659 INFO L462 AbstractCegarLoop]: Abstraction has 25207 states and 90336 transitions. [2019-12-27 07:13:26,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:13:26,659 INFO L276 IsEmpty]: Start isEmpty. Operand 25207 states and 90336 transitions. [2019-12-27 07:13:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:13:26,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:26,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:13:26,677 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:13:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1479335670, now seen corresponding path program 1 times [2019-12-27 07:13:26,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:26,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116309249] [2019-12-27 07:13:26,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:26,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:13:26,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116309249] [2019-12-27 07:13:26,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:26,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:13:26,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855418872] [2019-12-27 07:13:26,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:13:26,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:26,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:13:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:13:26,804 INFO L87 Difference]: Start difference. First operand 25207 states and 90336 transitions. Second operand 4 states. [2019-12-27 07:13:27,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:27,384 INFO L93 Difference]: Finished difference Result 38966 states and 133479 transitions. [2019-12-27 07:13:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:13:27,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:13:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:27,536 INFO L225 Difference]: With dead ends: 38966 [2019-12-27 07:13:27,536 INFO L226 Difference]: Without dead ends: 38948 [2019-12-27 07:13:27,537 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:13:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38948 states. [2019-12-27 07:13:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38948 to 37967. [2019-12-27 07:13:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37967 states. [2019-12-27 07:13:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37967 states to 37967 states and 130916 transitions. [2019-12-27 07:13:30,240 INFO L78 Accepts]: Start accepts. Automaton has 37967 states and 130916 transitions. Word has length 11 [2019-12-27 07:13:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:30,240 INFO L462 AbstractCegarLoop]: Abstraction has 37967 states and 130916 transitions. [2019-12-27 07:13:30,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:13:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 37967 states and 130916 transitions. [2019-12-27 07:13:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:13:30,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:30,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:13:30,244 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:13:30,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:30,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1793441041, now seen corresponding path program 1 times [2019-12-27 07:13:30,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:30,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229685260] [2019-12-27 07:13:30,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:30,319 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:30,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229685260] [2019-12-27 07:13:30,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:30,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:13:30,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740341737] [2019-12-27 07:13:30,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:13:30,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:13:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:13:30,322 INFO L87 Difference]: Start difference. First operand 37967 states and 130916 transitions. Second operand 4 states. [2019-12-27 07:13:32,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:32,167 INFO L93 Difference]: Finished difference Result 48754 states and 165257 transitions. [2019-12-27 07:13:32,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:13:32,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:13:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:32,330 INFO L225 Difference]: With dead ends: 48754 [2019-12-27 07:13:32,330 INFO L226 Difference]: Without dead ends: 48739 [2019-12-27 07:13:32,331 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:13:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48739 states. [2019-12-27 07:13:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48739 to 43861. [2019-12-27 07:13:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43861 states. [2019-12-27 07:13:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43861 states to 43861 states and 150189 transitions. [2019-12-27 07:13:34,010 INFO L78 Accepts]: Start accepts. Automaton has 43861 states and 150189 transitions. Word has length 14 [2019-12-27 07:13:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:34,011 INFO L462 AbstractCegarLoop]: Abstraction has 43861 states and 150189 transitions. [2019-12-27 07:13:34,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:13:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 43861 states and 150189 transitions. [2019-12-27 07:13:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 07:13:34,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:34,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:13:34,016 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:13:34,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:34,016 INFO L82 PathProgramCache]: Analyzing trace with hash 237931436, now seen corresponding path program 1 times [2019-12-27 07:13:34,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:34,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596126785] [2019-12-27 07:13:34,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:34,091 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:34,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596126785] [2019-12-27 07:13:34,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:34,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:13:34,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979705803] [2019-12-27 07:13:34,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:13:34,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:34,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:13:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:13:34,098 INFO L87 Difference]: Start difference. First operand 43861 states and 150189 transitions. Second operand 3 states. [2019-12-27 07:13:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:34,799 INFO L93 Difference]: Finished difference Result 71282 states and 233582 transitions. [2019-12-27 07:13:34,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:13:34,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 07:13:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:34,927 INFO L225 Difference]: With dead ends: 71282 [2019-12-27 07:13:34,927 INFO L226 Difference]: Without dead ends: 71282 [2019-12-27 07:13:34,928 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:13:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71282 states. [2019-12-27 07:13:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71282 to 63620. [2019-12-27 07:13:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63620 states. [2019-12-27 07:13:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63620 states to 63620 states and 211773 transitions. [2019-12-27 07:13:36,756 INFO L78 Accepts]: Start accepts. Automaton has 63620 states and 211773 transitions. Word has length 15 [2019-12-27 07:13:36,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:36,757 INFO L462 AbstractCegarLoop]: Abstraction has 63620 states and 211773 transitions. [2019-12-27 07:13:36,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:13:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 63620 states and 211773 transitions. [2019-12-27 07:13:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:13:36,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:36,762 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:13:36,762 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:13:36,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:36,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1616735725, now seen corresponding path program 1 times [2019-12-27 07:13:36,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:36,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143919370] [2019-12-27 07:13:36,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:36,832 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:36,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143919370] [2019-12-27 07:13:36,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:36,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:13:36,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734027804] [2019-12-27 07:13:36,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:13:36,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:36,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:13:36,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:13:36,835 INFO L87 Difference]: Start difference. First operand 63620 states and 211773 transitions. Second operand 3 states. [2019-12-27 07:13:38,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:38,516 INFO L93 Difference]: Finished difference Result 63517 states and 211446 transitions. [2019-12-27 07:13:38,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:13:38,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:13:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:38,635 INFO L225 Difference]: With dead ends: 63517 [2019-12-27 07:13:38,635 INFO L226 Difference]: Without dead ends: 63517 [2019-12-27 07:13:38,636 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:13:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63517 states. [2019-12-27 07:13:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63517 to 63517. [2019-12-27 07:13:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63517 states. [2019-12-27 07:13:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63517 states to 63517 states and 211446 transitions. [2019-12-27 07:13:40,186 INFO L78 Accepts]: Start accepts. Automaton has 63517 states and 211446 transitions. Word has length 16 [2019-12-27 07:13:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:40,187 INFO L462 AbstractCegarLoop]: Abstraction has 63517 states and 211446 transitions. [2019-12-27 07:13:40,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:13:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 63517 states and 211446 transitions. [2019-12-27 07:13:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:13:40,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:40,197 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:13:40,197 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:13:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1032158122, now seen corresponding path program 1 times [2019-12-27 07:13:40,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:40,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616645476] [2019-12-27 07:13:40,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:40,256 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:40,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616645476] [2019-12-27 07:13:40,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:40,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:13:40,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064043576] [2019-12-27 07:13:40,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:13:40,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:13:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:13:40,260 INFO L87 Difference]: Start difference. First operand 63517 states and 211446 transitions. Second operand 4 states. [2019-12-27 07:13:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:41,377 INFO L93 Difference]: Finished difference Result 77880 states and 255480 transitions. [2019-12-27 07:13:41,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:13:41,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:13:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:41,525 INFO L225 Difference]: With dead ends: 77880 [2019-12-27 07:13:41,525 INFO L226 Difference]: Without dead ends: 77863 [2019-12-27 07:13:41,525 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:13:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77863 states. [2019-12-27 07:13:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77863 to 64071. [2019-12-27 07:13:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64071 states. [2019-12-27 07:13:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64071 states to 64071 states and 213322 transitions. [2019-12-27 07:13:45,207 INFO L78 Accepts]: Start accepts. Automaton has 64071 states and 213322 transitions. Word has length 17 [2019-12-27 07:13:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:45,207 INFO L462 AbstractCegarLoop]: Abstraction has 64071 states and 213322 transitions. [2019-12-27 07:13:45,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:13:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 64071 states and 213322 transitions. [2019-12-27 07:13:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:13:45,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:45,215 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:13:45,215 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:13:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash 274413131, now seen corresponding path program 1 times [2019-12-27 07:13:45,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:45,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529799001] [2019-12-27 07:13:45,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:45,267 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:45,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529799001] [2019-12-27 07:13:45,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:45,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:13:45,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561947238] [2019-12-27 07:13:45,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:13:45,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:45,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:13:45,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:13:45,269 INFO L87 Difference]: Start difference. First operand 64071 states and 213322 transitions. Second operand 3 states. [2019-12-27 07:13:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:45,479 INFO L93 Difference]: Finished difference Result 60500 states and 201181 transitions. [2019-12-27 07:13:45,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:13:45,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 07:13:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:45,590 INFO L225 Difference]: With dead ends: 60500 [2019-12-27 07:13:45,590 INFO L226 Difference]: Without dead ends: 60374 [2019-12-27 07:13:45,590 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:13:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60374 states. [2019-12-27 07:13:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60374 to 60374. [2019-12-27 07:13:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60374 states. [2019-12-27 07:13:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60374 states to 60374 states and 200794 transitions. [2019-12-27 07:13:47,325 INFO L78 Accepts]: Start accepts. Automaton has 60374 states and 200794 transitions. Word has length 17 [2019-12-27 07:13:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:47,326 INFO L462 AbstractCegarLoop]: Abstraction has 60374 states and 200794 transitions. [2019-12-27 07:13:47,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:13:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 60374 states and 200794 transitions. [2019-12-27 07:13:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 07:13:47,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:47,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:13:47,338 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:13:47,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:47,339 INFO L82 PathProgramCache]: Analyzing trace with hash 363158557, now seen corresponding path program 1 times [2019-12-27 07:13:47,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:47,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558432323] [2019-12-27 07:13:47,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:47,412 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:47,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558432323] [2019-12-27 07:13:47,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:47,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:13:47,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320783448] [2019-12-27 07:13:47,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:13:47,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:47,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:13:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:13:47,414 INFO L87 Difference]: Start difference. First operand 60374 states and 200794 transitions. Second operand 5 states. [2019-12-27 07:13:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:50,250 INFO L93 Difference]: Finished difference Result 84981 states and 275357 transitions. [2019-12-27 07:13:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:13:50,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 07:13:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:50,393 INFO L225 Difference]: With dead ends: 84981 [2019-12-27 07:13:50,393 INFO L226 Difference]: Without dead ends: 84967 [2019-12-27 07:13:50,393 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:13:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84967 states. [2019-12-27 07:13:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84967 to 65930. [2019-12-27 07:13:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65930 states. [2019-12-27 07:13:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65930 states to 65930 states and 218108 transitions. [2019-12-27 07:13:52,212 INFO L78 Accepts]: Start accepts. Automaton has 65930 states and 218108 transitions. Word has length 20 [2019-12-27 07:13:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:52,212 INFO L462 AbstractCegarLoop]: Abstraction has 65930 states and 218108 transitions. [2019-12-27 07:13:52,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:13:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 65930 states and 218108 transitions. [2019-12-27 07:13:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 07:13:52,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:52,229 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:13:52,229 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:13:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1131596126, now seen corresponding path program 1 times [2019-12-27 07:13:52,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:52,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030415238] [2019-12-27 07:13:52,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:52,292 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:52,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030415238] [2019-12-27 07:13:52,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:52,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:13:52,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100138252] [2019-12-27 07:13:52,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:13:52,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:52,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:13:52,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:13:52,294 INFO L87 Difference]: Start difference. First operand 65930 states and 218108 transitions. Second operand 5 states. [2019-12-27 07:13:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:53,312 INFO L93 Difference]: Finished difference Result 89060 states and 288103 transitions. [2019-12-27 07:13:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:13:53,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 07:13:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:53,465 INFO L225 Difference]: With dead ends: 89060 [2019-12-27 07:13:53,465 INFO L226 Difference]: Without dead ends: 89032 [2019-12-27 07:13:53,466 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:13:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89032 states. [2019-12-27 07:13:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89032 to 61456. [2019-12-27 07:13:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61456 states. [2019-12-27 07:13:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61456 states to 61456 states and 203832 transitions. [2019-12-27 07:13:55,572 INFO L78 Accepts]: Start accepts. Automaton has 61456 states and 203832 transitions. Word has length 23 [2019-12-27 07:13:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:55,573 INFO L462 AbstractCegarLoop]: Abstraction has 61456 states and 203832 transitions. [2019-12-27 07:13:55,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:13:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 61456 states and 203832 transitions. [2019-12-27 07:13:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 07:13:55,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:55,623 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:13:55,623 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:13:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash -936804425, now seen corresponding path program 1 times [2019-12-27 07:13:55,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:55,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085720035] [2019-12-27 07:13:55,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:55,696 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:55,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085720035] [2019-12-27 07:13:55,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:55,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:13:55,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479638315] [2019-12-27 07:13:55,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:13:55,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:55,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:13:55,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:13:55,698 INFO L87 Difference]: Start difference. First operand 61456 states and 203832 transitions. Second operand 4 states. [2019-12-27 07:13:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:56,299 INFO L93 Difference]: Finished difference Result 115204 states and 375009 transitions. [2019-12-27 07:13:56,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:13:56,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-27 07:13:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:56,510 INFO L225 Difference]: With dead ends: 115204 [2019-12-27 07:13:56,510 INFO L226 Difference]: Without dead ends: 115204 [2019-12-27 07:13:56,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:13:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115204 states. [2019-12-27 07:13:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115204 to 78853. [2019-12-27 07:13:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78853 states. [2019-12-27 07:14:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78853 states to 78853 states and 262373 transitions. [2019-12-27 07:14:02,535 INFO L78 Accepts]: Start accepts. Automaton has 78853 states and 262373 transitions. Word has length 31 [2019-12-27 07:14:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:02,536 INFO L462 AbstractCegarLoop]: Abstraction has 78853 states and 262373 transitions. [2019-12-27 07:14:02,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 78853 states and 262373 transitions. [2019-12-27 07:14:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 07:14:02,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:02,591 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:02,591 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:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:02,591 INFO L82 PathProgramCache]: Analyzing trace with hash -372180425, now seen corresponding path program 2 times [2019-12-27 07:14:02,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:02,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786657790] [2019-12-27 07:14:02,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:02,651 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:02,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786657790] [2019-12-27 07:14:02,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:02,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:14:02,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795089020] [2019-12-27 07:14:02,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:14:02,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:02,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:14:02,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:14:02,654 INFO L87 Difference]: Start difference. First operand 78853 states and 262373 transitions. Second operand 3 states. [2019-12-27 07:14:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:02,920 INFO L93 Difference]: Finished difference Result 73759 states and 241892 transitions. [2019-12-27 07:14:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:14:02,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 07:14:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:03,044 INFO L225 Difference]: With dead ends: 73759 [2019-12-27 07:14:03,044 INFO L226 Difference]: Without dead ends: 73759 [2019-12-27 07:14:03,044 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:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73759 states. [2019-12-27 07:14:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73759 to 72519. [2019-12-27 07:14:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72519 states. [2019-12-27 07:14:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72519 states to 72519 states and 238188 transitions. [2019-12-27 07:14:05,146 INFO L78 Accepts]: Start accepts. Automaton has 72519 states and 238188 transitions. Word has length 31 [2019-12-27 07:14:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:05,146 INFO L462 AbstractCegarLoop]: Abstraction has 72519 states and 238188 transitions. [2019-12-27 07:14:05,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:14:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 72519 states and 238188 transitions. [2019-12-27 07:14:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:05,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:05,213 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:05,213 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:05,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1732188204, now seen corresponding path program 1 times [2019-12-27 07:14:05,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:05,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473360567] [2019-12-27 07:14:05,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:05,321 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:05,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473360567] [2019-12-27 07:14:05,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:05,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:14:05,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666330183] [2019-12-27 07:14:05,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:14:05,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:05,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:14:05,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:14:05,325 INFO L87 Difference]: Start difference. First operand 72519 states and 238188 transitions. Second operand 7 states. [2019-12-27 07:14:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:06,600 INFO L93 Difference]: Finished difference Result 163297 states and 534962 transitions. [2019-12-27 07:14:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:14:06,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 07:14:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:06,879 INFO L225 Difference]: With dead ends: 163297 [2019-12-27 07:14:06,879 INFO L226 Difference]: Without dead ends: 132243 [2019-12-27 07:14:06,879 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:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132243 states. [2019-12-27 07:14:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132243 to 115117. [2019-12-27 07:14:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115117 states. [2019-12-27 07:14:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115117 states to 115117 states and 379630 transitions. [2019-12-27 07:14:12,572 INFO L78 Accepts]: Start accepts. Automaton has 115117 states and 379630 transitions. Word has length 32 [2019-12-27 07:14:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:12,572 INFO L462 AbstractCegarLoop]: Abstraction has 115117 states and 379630 transitions. [2019-12-27 07:14:12,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:14:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 115117 states and 379630 transitions. [2019-12-27 07:14:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:12,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:12,671 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:12,672 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:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash 597590804, now seen corresponding path program 2 times [2019-12-27 07:14:12,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:12,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160951515] [2019-12-27 07:14:12,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:12,765 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:12,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160951515] [2019-12-27 07:14:12,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:12,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:14:12,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141480194] [2019-12-27 07:14:12,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:14:12,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:14:12,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:14:12,768 INFO L87 Difference]: Start difference. First operand 115117 states and 379630 transitions. Second operand 7 states. [2019-12-27 07:14:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:15,511 INFO L93 Difference]: Finished difference Result 207257 states and 684282 transitions. [2019-12-27 07:14:15,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:14:15,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 07:14:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:15,937 INFO L225 Difference]: With dead ends: 207257 [2019-12-27 07:14:15,937 INFO L226 Difference]: Without dead ends: 195003 [2019-12-27 07:14:15,940 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:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195003 states. [2019-12-27 07:14:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195003 to 115111. [2019-12-27 07:14:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115111 states. [2019-12-27 07:14:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115111 states to 115111 states and 379657 transitions. [2019-12-27 07:14:23,652 INFO L78 Accepts]: Start accepts. Automaton has 115111 states and 379657 transitions. Word has length 32 [2019-12-27 07:14:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:23,652 INFO L462 AbstractCegarLoop]: Abstraction has 115111 states and 379657 transitions. [2019-12-27 07:14:23,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:14:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 115111 states and 379657 transitions. [2019-12-27 07:14:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:23,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:23,750 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:23,750 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:23,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:23,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1306987540, now seen corresponding path program 3 times [2019-12-27 07:14:23,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:23,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283802467] [2019-12-27 07:14:23,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:23,910 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:23,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283802467] [2019-12-27 07:14:23,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:23,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:14:23,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801689579] [2019-12-27 07:14:23,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:14:23,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:23,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:14:23,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:14:23,912 INFO L87 Difference]: Start difference. First operand 115111 states and 379657 transitions. Second operand 10 states. [2019-12-27 07:14:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:25,571 INFO L93 Difference]: Finished difference Result 185316 states and 610348 transitions. [2019-12-27 07:14:25,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:14:25,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-27 07:14:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:25,927 INFO L225 Difference]: With dead ends: 185316 [2019-12-27 07:14:25,927 INFO L226 Difference]: Without dead ends: 174230 [2019-12-27 07:14:25,928 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:14:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174230 states. [2019-12-27 07:14:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174230 to 115930. [2019-12-27 07:14:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115930 states. [2019-12-27 07:14:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115930 states to 115930 states and 382204 transitions. [2019-12-27 07:14:36,000 INFO L78 Accepts]: Start accepts. Automaton has 115930 states and 382204 transitions. Word has length 32 [2019-12-27 07:14:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:36,000 INFO L462 AbstractCegarLoop]: Abstraction has 115930 states and 382204 transitions. [2019-12-27 07:14:36,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:14:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 115930 states and 382204 transitions. [2019-12-27 07:14:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:36,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:36,100 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:36,100 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:14:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:36,100 INFO L82 PathProgramCache]: Analyzing trace with hash -790939130, now seen corresponding path program 4 times [2019-12-27 07:14:36,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:36,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649857120] [2019-12-27 07:14:36,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:36,173 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,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649857120] [2019-12-27 07:14:36,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:36,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:14:36,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863930016] [2019-12-27 07:14:36,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:14:36,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:14:36,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:14:36,175 INFO L87 Difference]: Start difference. First operand 115930 states and 382204 transitions. Second operand 7 states. [2019-12-27 07:14:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:37,613 INFO L93 Difference]: Finished difference Result 189628 states and 624714 transitions. [2019-12-27 07:14:37,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:14:37,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 07:14:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:37,977 INFO L225 Difference]: With dead ends: 189628 [2019-12-27 07:14:37,977 INFO L226 Difference]: Without dead ends: 178954 [2019-12-27 07:14:37,977 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:14:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178954 states. [2019-12-27 07:14:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178954 to 115518. [2019-12-27 07:14:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115518 states. [2019-12-27 07:14:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115518 states to 115518 states and 380816 transitions. [2019-12-27 07:14:41,591 INFO L78 Accepts]: Start accepts. Automaton has 115518 states and 380816 transitions. Word has length 32 [2019-12-27 07:14:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:41,592 INFO L462 AbstractCegarLoop]: Abstraction has 115518 states and 380816 transitions. [2019-12-27 07:14:41,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:14:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 115518 states and 380816 transitions. [2019-12-27 07:14:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:14:41,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:41,706 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:14:41,706 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:14:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:41,706 INFO L82 PathProgramCache]: Analyzing trace with hash 4490691, now seen corresponding path program 1 times [2019-12-27 07:14:41,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:41,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579760296] [2019-12-27 07:14:41,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:41,773 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:41,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579760296] [2019-12-27 07:14:41,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:41,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:14:41,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058006626] [2019-12-27 07:14:41,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:14:41,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:41,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:14:41,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:14:41,775 INFO L87 Difference]: Start difference. First operand 115518 states and 380816 transitions. Second operand 4 states. [2019-12-27 07:14:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:41,868 INFO L93 Difference]: Finished difference Result 17167 states and 47358 transitions. [2019-12-27 07:14:41,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:14:41,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 07:14:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:41,881 INFO L225 Difference]: With dead ends: 17167 [2019-12-27 07:14:41,881 INFO L226 Difference]: Without dead ends: 9939 [2019-12-27 07:14:41,881 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:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9939 states. [2019-12-27 07:14:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9939 to 9560. [2019-12-27 07:14:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9560 states. [2019-12-27 07:14:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9560 states to 9560 states and 22505 transitions. [2019-12-27 07:14:41,988 INFO L78 Accepts]: Start accepts. Automaton has 9560 states and 22505 transitions. Word has length 33 [2019-12-27 07:14:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:41,988 INFO L462 AbstractCegarLoop]: Abstraction has 9560 states and 22505 transitions. [2019-12-27 07:14:41,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 9560 states and 22505 transitions. [2019-12-27 07:14:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 07:14:41,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:41,996 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:14:41,996 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:14:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2021850497, now seen corresponding path program 1 times [2019-12-27 07:14:41,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:41,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546268746] [2019-12-27 07:14:41,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:42,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:42,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546268746] [2019-12-27 07:14:42,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:42,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:14:42,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980446936] [2019-12-27 07:14:42,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:14:42,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:14:42,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:14:42,052 INFO L87 Difference]: Start difference. First operand 9560 states and 22505 transitions. Second operand 4 states. [2019-12-27 07:14:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:42,106 INFO L93 Difference]: Finished difference Result 10710 states and 25125 transitions. [2019-12-27 07:14:42,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:14:42,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-27 07:14:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:42,119 INFO L225 Difference]: With dead ends: 10710 [2019-12-27 07:14:42,119 INFO L226 Difference]: Without dead ends: 8709 [2019-12-27 07:14:42,120 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:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8709 states. [2019-12-27 07:14:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8709 to 8237. [2019-12-27 07:14:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-27 07:14:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 19464 transitions. [2019-12-27 07:14:42,239 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 19464 transitions. Word has length 44 [2019-12-27 07:14:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:42,240 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 19464 transitions. [2019-12-27 07:14:42,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 19464 transitions. [2019-12-27 07:14:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 07:14:42,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:42,246 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:14:42,247 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:14:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1006962917, now seen corresponding path program 2 times [2019-12-27 07:14:42,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:42,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579730377] [2019-12-27 07:14:42,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:42,323 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:42,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579730377] [2019-12-27 07:14:42,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:42,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:14:42,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233951473] [2019-12-27 07:14:42,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:14:42,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:42,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:14:42,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:14:42,326 INFO L87 Difference]: Start difference. First operand 8237 states and 19464 transitions. Second operand 5 states. [2019-12-27 07:14:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:42,395 INFO L93 Difference]: Finished difference Result 6325 states and 15094 transitions. [2019-12-27 07:14:42,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:14:42,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 07:14:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:42,397 INFO L225 Difference]: With dead ends: 6325 [2019-12-27 07:14:42,397 INFO L226 Difference]: Without dead ends: 696 [2019-12-27 07:14:42,398 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:14:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-12-27 07:14:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 692. [2019-12-27 07:14:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-12-27 07:14:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1524 transitions. [2019-12-27 07:14:42,407 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1524 transitions. Word has length 44 [2019-12-27 07:14:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:42,407 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 1524 transitions. [2019-12-27 07:14:42,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:14:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1524 transitions. [2019-12-27 07:14:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:14:42,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:42,409 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:14:42,409 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:14:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash -234128232, now seen corresponding path program 1 times [2019-12-27 07:14:42,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:42,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881362501] [2019-12-27 07:14:42,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:42,613 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:42,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881362501] [2019-12-27 07:14:42,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:42,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:14:42,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370139641] [2019-12-27 07:14:42,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:14:42,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:42,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:14:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:14:42,616 INFO L87 Difference]: Start difference. First operand 692 states and 1524 transitions. Second operand 8 states. [2019-12-27 07:14:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:42,886 INFO L93 Difference]: Finished difference Result 1253 states and 2705 transitions. [2019-12-27 07:14:42,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:14:42,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-27 07:14:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:42,888 INFO L225 Difference]: With dead ends: 1253 [2019-12-27 07:14:42,888 INFO L226 Difference]: Without dead ends: 930 [2019-12-27 07:14:42,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:14:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-12-27 07:14:42,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 768. [2019-12-27 07:14:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-27 07:14:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1655 transitions. [2019-12-27 07:14:42,900 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1655 transitions. Word has length 60 [2019-12-27 07:14:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:42,901 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1655 transitions. [2019-12-27 07:14:42,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:14:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1655 transitions. [2019-12-27 07:14:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:14:42,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:42,902 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:14:42,902 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:14:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash 663982360, now seen corresponding path program 2 times [2019-12-27 07:14:42,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:42,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2661822] [2019-12-27 07:14:42,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:14:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:14:43,107 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:14:43,108 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:14:43,112 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 |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) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1723~0.base_21| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1723~0.base_21|) (= 0 v_~x~0_9) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1723~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1723~0.base_21|) |v_ULTIMATE.start_main_~#t1723~0.offset_17| 0)) |v_#memory_int_15|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_21|)) (= 0 |v_ULTIMATE.start_main_~#t1723~0.offset_17|) (= 0 v_~y$flush_delayed~0_18) (= v_~y$w_buff0_used~0_130 0) (= v_~y$r_buff0_thd2~0_75 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= v_~y~0_32 0) (= 0 v_~weak$$choice2~0_35) (= (store .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_21| 1) |v_#valid_41|) (= 0 v_~y$w_buff1~0_32) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 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{ULTIMATE.start_main_~#t1723~0.base=|v_ULTIMATE.start_main_~#t1723~0.base_21|, ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_15|, ~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_#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, ~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|, ULTIMATE.start_main_~#t1723~0.offset=|v_ULTIMATE.start_main_~#t1723~0.offset_17|, ~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_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_18|, ~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[ULTIMATE.start_main_~#t1723~0.base, ULTIMATE.start_main_~#t1724~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~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, ULTIMATE.start_main_~#t1723~0.offset, ~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_~#t1724~0.base, ~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:14:43,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L813-1-->L815: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13|) |v_ULTIMATE.start_main_~#t1724~0.offset_11| 1)) |v_#memory_int_9|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1724~0.base_13| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1724~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1724~0.base_13| 0)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1724~0.offset_11|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, 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_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1724~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1724~0.base] because there is no mapped edge [2019-12-27 07:14:43,115 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:14:43,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1012104294 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1012104294 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1012104294| ~y$w_buff1~0_In-1012104294)) (and (not .cse1) (not .cse0) (= ~y$w_buff0~0_In-1012104294 |P1Thread1of1ForFork1_#t~ite28_Out-1012104294|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1012104294, ~y$w_buff1~0=~y$w_buff1~0_In-1012104294, ~y$w_buff0~0=~y$w_buff0~0_In-1012104294, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1012104294} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1012104294, ~y$w_buff1~0=~y$w_buff1~0_In-1012104294, ~y$w_buff0~0=~y$w_buff0~0_In-1012104294, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1012104294, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1012104294|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 07:14:43,119 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:14:43,126 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:14:43,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In494643319 256) 0))) (or (and (= ~y$mem_tmp~0_In494643319 |P1Thread1of1ForFork1_#t~ite48_Out494643319|) (not .cse0)) (and (= ~y~0_In494643319 |P1Thread1of1ForFork1_#t~ite48_Out494643319|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In494643319, ~y$flush_delayed~0=~y$flush_delayed~0_In494643319, ~y~0=~y~0_In494643319} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In494643319, ~y$flush_delayed~0=~y$flush_delayed~0_In494643319, ~y~0=~y~0_In494643319, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out494643319|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 07:14:43,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1327714411 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1327714411 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out-1327714411| ~y$w_buff0_used~0_In-1327714411) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out-1327714411| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1327714411, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1327714411} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1327714411, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1327714411|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1327714411} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 07:14:43,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In2079444424 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In2079444424 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2079444424 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2079444424 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out2079444424| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite52_Out2079444424| ~y$w_buff1_used~0_In2079444424) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2079444424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2079444424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2079444424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2079444424} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2079444424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2079444424, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out2079444424|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2079444424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2079444424} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 07:14:43,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-3231947 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-3231947 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-3231947) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-3231947 ~y$r_buff0_thd2~0_Out-3231947) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-3231947, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-3231947} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-3231947|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-3231947, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-3231947} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:14:43,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1352181555 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1352181555 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1352181555 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1352181555 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out1352181555| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In1352181555 |P1Thread1of1ForFork1_#t~ite54_Out1352181555|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1352181555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1352181555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1352181555, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1352181555} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1352181555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1352181555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1352181555, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1352181555|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1352181555} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 07:14:43,135 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:14:43,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In120325561 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out120325561| ~y~0_In120325561) .cse0) (and (= |P0Thread1of1ForFork0_#t~ite25_Out120325561| ~y$mem_tmp~0_In120325561) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In120325561, ~y$flush_delayed~0=~y$flush_delayed~0_In120325561, ~y~0=~y~0_In120325561} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In120325561, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out120325561|, ~y$flush_delayed~0=~y$flush_delayed~0_In120325561, ~y~0=~y~0_In120325561} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 07:14:43,146 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:14:43,147 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:14:43,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2131224235 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2131224235 256)))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out-2131224235| ~y~0_In-2131224235) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In-2131224235 |ULTIMATE.start_main_#t~ite57_Out-2131224235|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2131224235, ~y~0=~y~0_In-2131224235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2131224235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131224235} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2131224235, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-2131224235|, ~y~0=~y~0_In-2131224235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2131224235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131224235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 07:14:43,147 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:14:43,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1262877559 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1262877559 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-1262877559| ~y$w_buff0_used~0_In-1262877559)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out-1262877559|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1262877559, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1262877559} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1262877559, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1262877559, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1262877559|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 07:14:43,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In898615908 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In898615908 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In898615908 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In898615908 256)))) (or (and (= ~y$w_buff1_used~0_In898615908 |ULTIMATE.start_main_#t~ite60_Out898615908|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite60_Out898615908| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In898615908, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In898615908, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In898615908, ~y$w_buff1_used~0=~y$w_buff1_used~0_In898615908} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out898615908|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In898615908, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In898615908, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In898615908, ~y$w_buff1_used~0=~y$w_buff1_used~0_In898615908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 07:14:43,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In641189201 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In641189201 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In641189201 |ULTIMATE.start_main_#t~ite61_Out641189201|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out641189201| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In641189201, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In641189201} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out641189201|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In641189201, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In641189201} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 07:14:43,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1614987290 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1614987290 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1614987290 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1614987290 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1614987290| ~y$r_buff1_thd0~0_In1614987290) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out1614987290| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1614987290, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1614987290, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1614987290, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1614987290} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1614987290|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1614987290, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1614987290, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1614987290, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1614987290} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 07:14:43,150 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:14:43,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:14:43 BasicIcfg [2019-12-27 07:14:43,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:14:43,310 INFO L168 Benchmark]: Toolchain (without parser) took 87243.95 ms. Allocated memory was 139.5 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 102.3 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 07:14:43,311 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:14:43,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.35 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 156.6 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:14:43,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.83 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:14:43,315 INFO L168 Benchmark]: Boogie Preprocessor took 40.93 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:14:43,315 INFO L168 Benchmark]: RCFGBuilder took 990.41 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 98.1 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:14:43,316 INFO L168 Benchmark]: TraceAbstraction took 85375.88 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.1 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:14:43,326 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.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.35 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 156.6 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.83 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.93 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 990.41 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 98.1 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85375.88 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.1 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 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(&t1723, ((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(&t1724, ((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: 84.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4989 SDtfs, 5719 SDslu, 10074 SDs, 0 SdLazy, 3934 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115930occurred 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: 54.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 331288 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 569 NumberOfCodeBlocks, 569 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 51236 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...