/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:15:37,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:15:37,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:15:37,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:15:37,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:15:37,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:15:37,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:15:37,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:15:37,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:15:37,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:15:37,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:15:37,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:15:37,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:15:37,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:15:37,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:15:37,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:15:37,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:15:37,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:15:37,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:15:37,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:15:37,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:15:37,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:15:37,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:15:37,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:15:37,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:15:37,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:15:37,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:15:37,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:15:37,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:15:37,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:15:37,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:15:37,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:15:37,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:15:37,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:15:37,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:15:37,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:15:37,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:15:37,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:15:37,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:15:37,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:15:37,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:15:37,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:15:38,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:15:38,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:15:38,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:15:38,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:15:38,005 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:15:38,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:15:38,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:15:38,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:15:38,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:15:38,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:15:38,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:15:38,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:15:38,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:15:38,006 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:15:38,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:15:38,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:15:38,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:15:38,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:15:38,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:15:38,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:15:38,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:15:38,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:15:38,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:15:38,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:15:38,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:15:38,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:15:38,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:15:38,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:15:38,009 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:15:38,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:15:38,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:15:38,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:15:38,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:15:38,346 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:15:38,347 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:15:38,348 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_rmo.oepc.i [2019-12-18 14:15:38,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727a378c6/c738358ce600479983b736a3de01e7eb/FLAG00b7a616b [2019-12-18 14:15:38,941 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:15:38,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_rmo.oepc.i [2019-12-18 14:15:38,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727a378c6/c738358ce600479983b736a3de01e7eb/FLAG00b7a616b [2019-12-18 14:15:39,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727a378c6/c738358ce600479983b736a3de01e7eb [2019-12-18 14:15:39,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:15:39,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:15:39,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:15:39,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:15:39,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:15:39,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:15:39" (1/1) ... [2019-12-18 14:15:39,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b84ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:39, skipping insertion in model container [2019-12-18 14:15:39,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:15:39" (1/1) ... [2019-12-18 14:15:39,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:15:39,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:15:39,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:15:39,902 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:15:39,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:15:40,058 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:15:40,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40 WrapperNode [2019-12-18 14:15:40,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:15:40,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:15:40,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:15:40,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:15:40,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:15:40,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:15:40,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:15:40,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:15:40,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:15:40,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:15:40,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:15:40,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:15:40,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:15:40,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:15:40,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:15:40,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:15:40,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:15:40,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:15:40,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:15:40,268 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:15:40,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:15:40,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:15:40,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:15:40,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:15:40,271 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:15:41,077 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:15:41,077 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:15:41,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:15:41 BoogieIcfgContainer [2019-12-18 14:15:41,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:15:41,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:15:41,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:15:41,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:15:41,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:15:39" (1/3) ... [2019-12-18 14:15:41,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c69f34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:15:41, skipping insertion in model container [2019-12-18 14:15:41,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40" (2/3) ... [2019-12-18 14:15:41,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c69f34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:15:41, skipping insertion in model container [2019-12-18 14:15:41,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:15:41" (3/3) ... [2019-12-18 14:15:41,089 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.oepc.i [2019-12-18 14:15:41,100 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:15:41,100 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:15:41,108 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:15:41,109 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:15:41,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,187 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,277 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,280 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,287 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,288 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,292 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:41,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:15:41,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:15:41,332 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:15:41,332 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:15:41,332 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:15:41,332 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:15:41,332 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:15:41,332 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:15:41,332 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:15:41,354 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-18 14:15:41,356 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-18 14:15:41,469 INFO L126 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-18 14:15:41,469 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:15:41,494 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 625 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 14:15:41,535 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-18 14:15:41,588 INFO L126 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-18 14:15:41,588 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:15:41,599 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 625 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 14:15:41,630 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-18 14:15:41,631 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:15:47,479 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:15:47,583 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:15:47,637 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-18 14:15:47,637 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 14:15:47,641 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-18 14:15:49,430 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-18 14:15:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-18 14:15:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:15:49,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:49,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:15:49,438 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:49,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:49,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-18 14:15:49,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:49,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929014215] [2019-12-18 14:15:49,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:49,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929014215] [2019-12-18 14:15:49,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:49,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:15:49,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522729205] [2019-12-18 14:15:49,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:15:49,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:15:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:49,749 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-18 14:15:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:50,239 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-18 14:15:50,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:15:50,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:15:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:50,499 INFO L225 Difference]: With dead ends: 29506 [2019-12-18 14:15:50,499 INFO L226 Difference]: Without dead ends: 27490 [2019-12-18 14:15:50,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-18 14:15:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-18 14:15:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-18 14:15:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-18 14:15:52,969 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-18 14:15:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:52,969 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-18 14:15:52,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:15:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-18 14:15:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:15:52,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:52,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:52,974 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:52,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:52,974 INFO L82 PathProgramCache]: Analyzing trace with hash -272589760, now seen corresponding path program 1 times [2019-12-18 14:15:52,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:52,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000893715] [2019-12-18 14:15:52,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:53,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000893715] [2019-12-18 14:15:53,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:53,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:15:53,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926184501] [2019-12-18 14:15:53,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:15:53,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:53,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:15:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:53,020 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 3 states. [2019-12-18 14:15:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:53,071 INFO L93 Difference]: Finished difference Result 3269 states and 8037 transitions. [2019-12-18 14:15:53,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:15:53,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 14:15:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:53,086 INFO L225 Difference]: With dead ends: 3269 [2019-12-18 14:15:53,086 INFO L226 Difference]: Without dead ends: 3269 [2019-12-18 14:15:53,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-12-18 14:15:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3269. [2019-12-18 14:15:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-18 14:15:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8037 transitions. [2019-12-18 14:15:53,160 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8037 transitions. Word has length 11 [2019-12-18 14:15:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:53,160 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8037 transitions. [2019-12-18 14:15:53,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:15:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8037 transitions. [2019-12-18 14:15:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:15:53,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:53,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:53,163 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-18 14:15:53,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:53,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965031995] [2019-12-18 14:15:53,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:53,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965031995] [2019-12-18 14:15:53,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:53,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:15:53,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298394733] [2019-12-18 14:15:53,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:15:53,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:53,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:15:53,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:15:53,237 INFO L87 Difference]: Start difference. First operand 3269 states and 8037 transitions. Second operand 4 states. [2019-12-18 14:15:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:53,533 INFO L93 Difference]: Finished difference Result 4313 states and 10392 transitions. [2019-12-18 14:15:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:15:53,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:15:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:53,550 INFO L225 Difference]: With dead ends: 4313 [2019-12-18 14:15:53,551 INFO L226 Difference]: Without dead ends: 4313 [2019-12-18 14:15:53,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-18 14:15:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4245. [2019-12-18 14:15:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-18 14:15:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 10260 transitions. [2019-12-18 14:15:53,679 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 10260 transitions. Word has length 14 [2019-12-18 14:15:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:53,679 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 10260 transitions. [2019-12-18 14:15:53,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:15:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 10260 transitions. [2019-12-18 14:15:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 14:15:53,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:53,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:53,682 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash 566526596, now seen corresponding path program 1 times [2019-12-18 14:15:53,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:53,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070720316] [2019-12-18 14:15:53,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:53,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070720316] [2019-12-18 14:15:53,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:53,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:15:53,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648260144] [2019-12-18 14:15:53,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:15:53,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:15:53,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:53,731 INFO L87 Difference]: Start difference. First operand 4245 states and 10260 transitions. Second operand 3 states. [2019-12-18 14:15:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:53,835 INFO L93 Difference]: Finished difference Result 7552 states and 17381 transitions. [2019-12-18 14:15:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:15:53,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 14:15:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:53,852 INFO L225 Difference]: With dead ends: 7552 [2019-12-18 14:15:53,852 INFO L226 Difference]: Without dead ends: 7552 [2019-12-18 14:15:53,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2019-12-18 14:15:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6526. [2019-12-18 14:15:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-18 14:15:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 15257 transitions. [2019-12-18 14:15:54,009 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 15257 transitions. Word has length 15 [2019-12-18 14:15:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:54,010 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 15257 transitions. [2019-12-18 14:15:54,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:15:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 15257 transitions. [2019-12-18 14:15:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:15:54,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:54,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:54,013 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:54,013 INFO L82 PathProgramCache]: Analyzing trace with hash -759251224, now seen corresponding path program 1 times [2019-12-18 14:15:54,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:54,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482877009] [2019-12-18 14:15:54,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:54,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482877009] [2019-12-18 14:15:54,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:54,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:15:54,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341696509] [2019-12-18 14:15:54,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:15:54,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:54,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:15:54,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:15:54,109 INFO L87 Difference]: Start difference. First operand 6526 states and 15257 transitions. Second operand 4 states. [2019-12-18 14:15:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:54,515 INFO L93 Difference]: Finished difference Result 7957 states and 18351 transitions. [2019-12-18 14:15:54,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:15:54,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:15:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:54,532 INFO L225 Difference]: With dead ends: 7957 [2019-12-18 14:15:54,533 INFO L226 Difference]: Without dead ends: 7957 [2019-12-18 14:15:54,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-12-18 14:15:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 6579. [2019-12-18 14:15:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-18 14:15:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 15368 transitions. [2019-12-18 14:15:54,670 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 15368 transitions. Word has length 17 [2019-12-18 14:15:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:54,671 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 15368 transitions. [2019-12-18 14:15:54,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:15:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 15368 transitions. [2019-12-18 14:15:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:15:54,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:54,676 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] [2019-12-18 14:15:54,677 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1258171186, now seen corresponding path program 1 times [2019-12-18 14:15:54,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:54,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966623897] [2019-12-18 14:15:54,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:54,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966623897] [2019-12-18 14:15:54,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:54,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:15:54,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164002704] [2019-12-18 14:15:54,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:15:54,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:54,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:15:54,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:54,772 INFO L87 Difference]: Start difference. First operand 6579 states and 15368 transitions. Second operand 5 states. [2019-12-18 14:15:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:55,202 INFO L93 Difference]: Finished difference Result 8876 states and 20253 transitions. [2019-12-18 14:15:55,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:15:55,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:15:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:55,221 INFO L225 Difference]: With dead ends: 8876 [2019-12-18 14:15:55,221 INFO L226 Difference]: Without dead ends: 8876 [2019-12-18 14:15:55,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:15:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8876 states. [2019-12-18 14:15:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8876 to 8439. [2019-12-18 14:15:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-12-18 14:15:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 19387 transitions. [2019-12-18 14:15:55,404 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 19387 transitions. Word has length 27 [2019-12-18 14:15:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:55,405 INFO L462 AbstractCegarLoop]: Abstraction has 8439 states and 19387 transitions. [2019-12-18 14:15:55,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:15:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 19387 transitions. [2019-12-18 14:15:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 14:15:55,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:55,414 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] [2019-12-18 14:15:55,415 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1366134434, now seen corresponding path program 1 times [2019-12-18 14:15:55,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:55,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482436300] [2019-12-18 14:15:55,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:55,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482436300] [2019-12-18 14:15:55,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:55,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:15:55,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255525080] [2019-12-18 14:15:55,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:15:55,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:15:55,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:55,463 INFO L87 Difference]: Start difference. First operand 8439 states and 19387 transitions. Second operand 3 states. [2019-12-18 14:15:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:55,547 INFO L93 Difference]: Finished difference Result 9584 states and 20860 transitions. [2019-12-18 14:15:55,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:15:55,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 14:15:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:55,560 INFO L225 Difference]: With dead ends: 9584 [2019-12-18 14:15:55,560 INFO L226 Difference]: Without dead ends: 9584 [2019-12-18 14:15:55,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-12-18 14:15:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 8440. [2019-12-18 14:15:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-12-18 14:15:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 18504 transitions. [2019-12-18 14:15:55,737 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 18504 transitions. Word has length 30 [2019-12-18 14:15:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:55,737 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 18504 transitions. [2019-12-18 14:15:55,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:15:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 18504 transitions. [2019-12-18 14:15:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:15:55,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:55,747 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-18 14:15:55,748 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash -736726388, now seen corresponding path program 1 times [2019-12-18 14:15:55,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:55,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373288498] [2019-12-18 14:15:55,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:55,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373288498] [2019-12-18 14:15:55,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:55,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:15:55,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846865118] [2019-12-18 14:15:55,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:15:55,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:15:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:55,882 INFO L87 Difference]: Start difference. First operand 8440 states and 18504 transitions. Second operand 5 states. [2019-12-18 14:15:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:56,410 INFO L93 Difference]: Finished difference Result 9537 states and 20673 transitions. [2019-12-18 14:15:56,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:15:56,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 14:15:56,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:56,423 INFO L225 Difference]: With dead ends: 9537 [2019-12-18 14:15:56,423 INFO L226 Difference]: Without dead ends: 9537 [2019-12-18 14:15:56,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:15:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-18 14:15:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7558. [2019-12-18 14:15:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7558 states. [2019-12-18 14:15:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7558 states to 7558 states and 16717 transitions. [2019-12-18 14:15:56,574 INFO L78 Accepts]: Start accepts. Automaton has 7558 states and 16717 transitions. Word has length 33 [2019-12-18 14:15:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:56,577 INFO L462 AbstractCegarLoop]: Abstraction has 7558 states and 16717 transitions. [2019-12-18 14:15:56,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:15:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7558 states and 16717 transitions. [2019-12-18 14:15:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:15:56,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:56,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:56,596 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:56,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1616999435, now seen corresponding path program 1 times [2019-12-18 14:15:56,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:56,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215965023] [2019-12-18 14:15:56,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:56,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215965023] [2019-12-18 14:15:56,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:56,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:15:56,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354145474] [2019-12-18 14:15:56,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:15:56,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:15:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:15:56,704 INFO L87 Difference]: Start difference. First operand 7558 states and 16717 transitions. Second operand 4 states. [2019-12-18 14:15:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:56,743 INFO L93 Difference]: Finished difference Result 5263 states and 11555 transitions. [2019-12-18 14:15:56,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:15:56,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 14:15:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:56,753 INFO L225 Difference]: With dead ends: 5263 [2019-12-18 14:15:56,753 INFO L226 Difference]: Without dead ends: 5263 [2019-12-18 14:15:56,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:15:56,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-18 14:15:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5159. [2019-12-18 14:15:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-12-18 14:15:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11362 transitions. [2019-12-18 14:15:56,868 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11362 transitions. Word has length 39 [2019-12-18 14:15:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:56,869 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11362 transitions. [2019-12-18 14:15:56,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:15:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11362 transitions. [2019-12-18 14:15:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:15:56,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:56,884 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:56,885 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:56,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1602567421, now seen corresponding path program 1 times [2019-12-18 14:15:56,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:56,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958975790] [2019-12-18 14:15:56,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:57,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958975790] [2019-12-18 14:15:57,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:57,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:15:57,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453732175] [2019-12-18 14:15:57,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:15:57,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:57,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:15:57,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:15:57,005 INFO L87 Difference]: Start difference. First operand 5159 states and 11362 transitions. Second operand 8 states. [2019-12-18 14:15:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:57,466 INFO L93 Difference]: Finished difference Result 9824 states and 21398 transitions. [2019-12-18 14:15:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:15:57,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-18 14:15:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:57,479 INFO L225 Difference]: With dead ends: 9824 [2019-12-18 14:15:57,479 INFO L226 Difference]: Without dead ends: 8719 [2019-12-18 14:15:57,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:15:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-12-18 14:15:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 6443. [2019-12-18 14:15:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6443 states. [2019-12-18 14:15:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 14388 transitions. [2019-12-18 14:15:57,624 INFO L78 Accepts]: Start accepts. Automaton has 6443 states and 14388 transitions. Word has length 68 [2019-12-18 14:15:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:57,625 INFO L462 AbstractCegarLoop]: Abstraction has 6443 states and 14388 transitions. [2019-12-18 14:15:57,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:15:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6443 states and 14388 transitions. [2019-12-18 14:15:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:15:57,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:57,641 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:57,642 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash -544831189, now seen corresponding path program 2 times [2019-12-18 14:15:57,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:57,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951019540] [2019-12-18 14:15:57,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:57,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951019540] [2019-12-18 14:15:57,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:57,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:15:57,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644933784] [2019-12-18 14:15:57,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:15:57,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:57,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:15:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:57,744 INFO L87 Difference]: Start difference. First operand 6443 states and 14388 transitions. Second operand 5 states. [2019-12-18 14:15:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:57,894 INFO L93 Difference]: Finished difference Result 9381 states and 20893 transitions. [2019-12-18 14:15:57,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:15:57,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-18 14:15:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:57,906 INFO L225 Difference]: With dead ends: 9381 [2019-12-18 14:15:57,907 INFO L226 Difference]: Without dead ends: 7879 [2019-12-18 14:15:57,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:15:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-12-18 14:15:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7779. [2019-12-18 14:15:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-18 14:15:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 17459 transitions. [2019-12-18 14:15:58,087 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 17459 transitions. Word has length 68 [2019-12-18 14:15:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:58,088 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 17459 transitions. [2019-12-18 14:15:58,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:15:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 17459 transitions. [2019-12-18 14:15:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:15:58,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:58,105 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:58,105 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash 402951891, now seen corresponding path program 3 times [2019-12-18 14:15:58,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:58,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471696710] [2019-12-18 14:15:58,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:58,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471696710] [2019-12-18 14:15:58,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:58,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:15:58,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850580716] [2019-12-18 14:15:58,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:15:58,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:15:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:15:58,328 INFO L87 Difference]: Start difference. First operand 7779 states and 17459 transitions. Second operand 8 states. [2019-12-18 14:15:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:58,848 INFO L93 Difference]: Finished difference Result 11922 states and 26443 transitions. [2019-12-18 14:15:58,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:15:58,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-18 14:15:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:58,861 INFO L225 Difference]: With dead ends: 11922 [2019-12-18 14:15:58,861 INFO L226 Difference]: Without dead ends: 11455 [2019-12-18 14:15:58,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:15:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11455 states. [2019-12-18 14:15:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 7833. [2019-12-18 14:15:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-12-18 14:15:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 17576 transitions. [2019-12-18 14:15:59,024 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 17576 transitions. Word has length 68 [2019-12-18 14:15:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:59,025 INFO L462 AbstractCegarLoop]: Abstraction has 7833 states and 17576 transitions. [2019-12-18 14:15:59,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:15:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 17576 transitions. [2019-12-18 14:15:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:15:59,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:59,040 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:59,040 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1969468459, now seen corresponding path program 4 times [2019-12-18 14:15:59,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:59,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893109630] [2019-12-18 14:15:59,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:59,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893109630] [2019-12-18 14:15:59,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:59,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:15:59,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335320416] [2019-12-18 14:15:59,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:15:59,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:59,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:15:59,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:15:59,109 INFO L87 Difference]: Start difference. First operand 7833 states and 17576 transitions. Second operand 4 states. [2019-12-18 14:15:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:59,149 INFO L93 Difference]: Finished difference Result 8537 states and 19081 transitions. [2019-12-18 14:15:59,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:15:59,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-18 14:15:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:59,151 INFO L225 Difference]: With dead ends: 8537 [2019-12-18 14:15:59,151 INFO L226 Difference]: Without dead ends: 890 [2019-12-18 14:15:59,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-18 14:15:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2019-12-18 14:15:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-18 14:15:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1849 transitions. [2019-12-18 14:15:59,163 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1849 transitions. Word has length 68 [2019-12-18 14:15:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:59,164 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1849 transitions. [2019-12-18 14:15:59,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:15:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1849 transitions. [2019-12-18 14:15:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 14:15:59,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:59,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:59,166 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:59,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash 26038562, now seen corresponding path program 1 times [2019-12-18 14:15:59,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:59,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73261013] [2019-12-18 14:15:59,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:59,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73261013] [2019-12-18 14:15:59,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:59,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:15:59,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123373120] [2019-12-18 14:15:59,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:15:59,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:15:59,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:15:59,377 INFO L87 Difference]: Start difference. First operand 890 states and 1849 transitions. Second operand 9 states. [2019-12-18 14:16:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:00,069 INFO L93 Difference]: Finished difference Result 1464 states and 2888 transitions. [2019-12-18 14:16:00,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:16:00,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-12-18 14:16:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:00,077 INFO L225 Difference]: With dead ends: 1464 [2019-12-18 14:16:00,077 INFO L226 Difference]: Without dead ends: 1440 [2019-12-18 14:16:00,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:16:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2019-12-18 14:16:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1224. [2019-12-18 14:16:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-12-18 14:16:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 2449 transitions. [2019-12-18 14:16:00,095 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 2449 transitions. Word has length 69 [2019-12-18 14:16:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:00,096 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 2449 transitions. [2019-12-18 14:16:00,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:16:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 2449 transitions. [2019-12-18 14:16:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 14:16:00,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:00,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:16:00,099 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -759943924, now seen corresponding path program 2 times [2019-12-18 14:16:00,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:00,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237485778] [2019-12-18 14:16:00,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:16:00,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237485778] [2019-12-18 14:16:00,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:00,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:16:00,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448454169] [2019-12-18 14:16:00,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:16:00,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:00,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:16:00,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:16:00,174 INFO L87 Difference]: Start difference. First operand 1224 states and 2449 transitions. Second operand 3 states. [2019-12-18 14:16:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:00,190 INFO L93 Difference]: Finished difference Result 1224 states and 2448 transitions. [2019-12-18 14:16:00,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:16:00,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-18 14:16:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:00,192 INFO L225 Difference]: With dead ends: 1224 [2019-12-18 14:16:00,192 INFO L226 Difference]: Without dead ends: 1224 [2019-12-18 14:16:00,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:16:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-18 14:16:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1159. [2019-12-18 14:16:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-12-18 14:16:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2332 transitions. [2019-12-18 14:16:00,209 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2332 transitions. Word has length 69 [2019-12-18 14:16:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:00,210 INFO L462 AbstractCegarLoop]: Abstraction has 1159 states and 2332 transitions. [2019-12-18 14:16:00,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:16:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2332 transitions. [2019-12-18 14:16:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 14:16:00,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:00,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:16:00,213 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1670334514, now seen corresponding path program 1 times [2019-12-18 14:16:00,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:00,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994438319] [2019-12-18 14:16:00,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:16:00,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994438319] [2019-12-18 14:16:00,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:00,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:16:00,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013210285] [2019-12-18 14:16:00,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:16:00,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:16:00,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:16:00,366 INFO L87 Difference]: Start difference. First operand 1159 states and 2332 transitions. Second operand 5 states. [2019-12-18 14:16:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:00,473 INFO L93 Difference]: Finished difference Result 1300 states and 2608 transitions. [2019-12-18 14:16:00,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:16:00,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-18 14:16:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:00,476 INFO L225 Difference]: With dead ends: 1300 [2019-12-18 14:16:00,476 INFO L226 Difference]: Without dead ends: 1300 [2019-12-18 14:16:00,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:16:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-18 14:16:00,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1109. [2019-12-18 14:16:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2019-12-18 14:16:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 2238 transitions. [2019-12-18 14:16:00,498 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 2238 transitions. Word has length 70 [2019-12-18 14:16:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:00,498 INFO L462 AbstractCegarLoop]: Abstraction has 1109 states and 2238 transitions. [2019-12-18 14:16:00,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:16:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 2238 transitions. [2019-12-18 14:16:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 14:16:00,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:00,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:16:00,502 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:00,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash 477046829, now seen corresponding path program 1 times [2019-12-18 14:16:00,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:00,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151957346] [2019-12-18 14:16:00,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:16:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:16:00,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:16:00,692 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:16:00,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51|)) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| 4)) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51|) |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51| 1)) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1729~0.base_51|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1729~0.base=|v_ULTIMATE.start_main_~#t1729~0.base_51|, ~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_18|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_23|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t1729~0.offset=|v_ULTIMATE.start_main_~#t1729~0.offset_32|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1729~0.base, ~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1730~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1730~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1729~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:16:00,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1730~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1730~0.base_11|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11|) |v_ULTIMATE.start_main_~#t1730~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1730~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1730~0.offset, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-18 14:16:00,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~weak$$choice2~0_Out1816388022 ~x$flush_delayed~0_Out1816388022) (= ~x$r_buff0_thd1~0_Out1816388022 1) (= |P0Thread1of1ForFork1_#t~nondet3_In1816388022| ~weak$$choice0~0_Out1816388022) (= ~x~0_In1816388022 ~x$mem_tmp~0_Out1816388022) (= ~x$r_buff1_thd0~0_Out1816388022 ~x$r_buff0_thd0~0_In1816388022) (= ~x$r_buff1_thd2~0_Out1816388022 ~x$r_buff0_thd2~0_In1816388022) (= ~x$r_buff0_thd1~0_In1816388022 ~x$r_buff1_thd1~0_Out1816388022) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1816388022)) (= ~weak$$choice2~0_Out1816388022 |P0Thread1of1ForFork1_#t~nondet4_In1816388022|)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1816388022, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1816388022, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1816388022, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1816388022|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1816388022, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1816388022|, ~x~0=~x~0_In1816388022} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1816388022, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1816388022, ~x$flush_delayed~0=~x$flush_delayed~0_Out1816388022, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1816388022, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1816388022, ~x$mem_tmp~0=~x$mem_tmp~0_Out1816388022, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1816388022, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1816388022, ~weak$$choice0~0=~weak$$choice0~0_Out1816388022, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1816388022, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1816388022|, ~weak$$choice2~0=~weak$$choice2~0_Out1816388022, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1816388022|, ~x~0=~x~0_In1816388022} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-18 14:16:00,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In769112235 256) 0)) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out769112235| |P0Thread1of1ForFork1_#t~ite5_Out769112235|)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In769112235 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork1_#t~ite5_Out769112235| ~x$w_buff1~0_In769112235)) (and (not .cse1) .cse2 (not .cse0) (= ~x$w_buff0~0_In769112235 |P0Thread1of1ForFork1_#t~ite5_Out769112235|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In769112235, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In769112235, ~x$w_buff1~0=~x$w_buff1~0_In769112235, ~x$w_buff0_used~0=~x$w_buff0_used~0_In769112235} OutVars{~x$w_buff0~0=~x$w_buff0~0_In769112235, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out769112235|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In769112235, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out769112235|, ~x$w_buff1~0=~x$w_buff1~0_In769112235, ~x$w_buff0_used~0=~x$w_buff0_used~0_In769112235} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 14:16:00,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_11|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 14:16:00,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1894254808 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite25_Out1894254808| ~x$mem_tmp~0_In1894254808) (not .cse0)) (and (= |P0Thread1of1ForFork1_#t~ite25_Out1894254808| ~x~0_In1894254808) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1894254808, ~x$mem_tmp~0=~x$mem_tmp~0_In1894254808, ~x~0=~x~0_In1894254808} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out1894254808|, ~x$flush_delayed~0=~x$flush_delayed~0_In1894254808, ~x$mem_tmp~0=~x$mem_tmp~0_In1894254808, ~x~0=~x~0_In1894254808} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 14:16:00,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In1681891652 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out1681891652| ~x~0_In1681891652) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out1681891652| ~x$mem_tmp~0_In1681891652)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1681891652, ~x$mem_tmp~0=~x$mem_tmp~0_In1681891652, ~x~0=~x~0_In1681891652} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out1681891652|, ~x$flush_delayed~0=~x$flush_delayed~0_In1681891652, ~x$mem_tmp~0=~x$mem_tmp~0_In1681891652, ~x~0=~x~0_In1681891652} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 14:16:00,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-909738326 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-909738326 256) 0))) (or (and (= ~x$w_buff1~0_In-909738326 |P1Thread1of1ForFork0_#t~ite55_Out-909738326|) (not .cse0) (not .cse1)) (and (= ~x~0_In-909738326 |P1Thread1of1ForFork0_#t~ite55_Out-909738326|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-909738326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-909738326, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-909738326, ~x~0=~x~0_In-909738326} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-909738326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-909738326, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-909738326, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-909738326|, ~x~0=~x~0_In-909738326} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-18 14:16:00,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_10|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_10|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_13|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_9|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-18 14:16:00,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In330077399 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In330077399 256)))) (or (and (= ~x$w_buff0_used~0_In330077399 |P1Thread1of1ForFork0_#t~ite57_Out330077399|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite57_Out330077399|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In330077399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In330077399} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out330077399|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In330077399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In330077399} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-18 14:16:00,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1654571875 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1654571875 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1654571875 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1654571875 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite58_Out1654571875|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1654571875 |P1Thread1of1ForFork0_#t~ite58_Out1654571875|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1654571875, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1654571875, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1654571875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1654571875} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out1654571875|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1654571875, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1654571875, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1654571875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1654571875} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-18 14:16:00,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1333538521 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1333538521 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1333538521 |P1Thread1of1ForFork0_#t~ite59_Out1333538521|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out1333538521|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1333538521, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1333538521} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1333538521, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out1333538521|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1333538521} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-18 14:16:00,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In507855194 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In507855194 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In507855194 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In507855194 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite60_Out507855194| ~x$r_buff1_thd2~0_In507855194) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite60_Out507855194|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In507855194, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In507855194, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In507855194, ~x$w_buff0_used~0=~x$w_buff0_used~0_In507855194} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out507855194|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In507855194, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In507855194, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In507855194, ~x$w_buff0_used~0=~x$w_buff0_used~0_In507855194} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-18 14:16:00,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_36|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:16:00,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1976855484 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1976855484 256)))) (or (and (= ~x$w_buff0_used~0_In-1976855484 |P0Thread1of1ForFork1_#t~ite28_Out-1976855484|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out-1976855484|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1976855484, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1976855484} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1976855484, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-1976855484|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1976855484} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 14:16:00,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-184947514 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-184947514 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-184947514 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-184947514 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite29_Out-184947514| ~x$w_buff1_used~0_In-184947514)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite29_Out-184947514| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-184947514, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-184947514, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-184947514, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-184947514} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-184947514, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-184947514|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-184947514, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-184947514, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-184947514} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 14:16:00,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-29634799 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-29634799 256) 0))) (or (and (= 0 ~x$r_buff0_thd1~0_Out-29634799) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In-29634799 ~x$r_buff0_thd1~0_Out-29634799)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-29634799, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-29634799} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-29634799, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-29634799|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-29634799} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 14:16:00,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1449016070 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1449016070 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1449016070 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1449016070 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite31_Out1449016070| ~x$r_buff1_thd1~0_In1449016070)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite31_Out1449016070| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1449016070, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1449016070, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1449016070, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1449016070} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1449016070, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1449016070, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1449016070, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out1449016070|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1449016070} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 14:16:00,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_36|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_36|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_35|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 14:16:00,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:16:00,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite64_Out-1475548527| |ULTIMATE.start_main_#t~ite63_Out-1475548527|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1475548527 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1475548527 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In-1475548527 |ULTIMATE.start_main_#t~ite63_Out-1475548527|)) (and .cse0 (not .cse2) (not .cse1) (= ~x$w_buff1~0_In-1475548527 |ULTIMATE.start_main_#t~ite63_Out-1475548527|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1475548527, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1475548527, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1475548527, ~x~0=~x~0_In-1475548527} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1475548527|, ~x$w_buff1~0=~x$w_buff1~0_In-1475548527, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1475548527, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1475548527, ~x~0=~x~0_In-1475548527, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1475548527|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 14:16:00,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In728742328 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In728742328 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite65_Out728742328| ~x$w_buff0_used~0_In728742328)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out728742328| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In728742328, ~x$w_buff0_used~0=~x$w_buff0_used~0_In728742328} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In728742328, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out728742328|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In728742328} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-18 14:16:00,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In473015699 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In473015699 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In473015699 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In473015699 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite66_Out473015699| 0)) (and (= |ULTIMATE.start_main_#t~ite66_Out473015699| ~x$w_buff1_used~0_In473015699) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In473015699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In473015699, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In473015699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In473015699} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In473015699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In473015699, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out473015699|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In473015699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In473015699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-18 14:16:00,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-555303863 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-555303863 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite67_Out-555303863| 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-555303863 |ULTIMATE.start_main_#t~ite67_Out-555303863|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-555303863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-555303863} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-555303863, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-555303863|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-555303863} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-18 14:16:00,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In686107042 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In686107042 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In686107042 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In686107042 256)))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out686107042| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite68_Out686107042| ~x$r_buff1_thd0~0_In686107042) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In686107042, ~x$w_buff1_used~0=~x$w_buff1_used~0_In686107042, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In686107042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In686107042} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In686107042, ~x$w_buff1_used~0=~x$w_buff1_used~0_In686107042, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out686107042|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In686107042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In686107042} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 14:16:00,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~main$tmp_guard1~0_40 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:16:00,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:16:00 BasicIcfg [2019-12-18 14:16:00,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:16:00,825 INFO L168 Benchmark]: Toolchain (without parser) took 21612.77 ms. Allocated memory was 142.6 MB in the beginning and 845.2 MB in the end (delta: 702.5 MB). Free memory was 98.5 MB in the beginning and 219.3 MB in the end (delta: -120.8 MB). Peak memory consumption was 581.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:16:00,826 INFO L168 Benchmark]: CDTParser took 1.61 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:16:00,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.13 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.3 MB in the beginning and 150.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:16:00,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.58 ms. Allocated memory is still 200.3 MB. Free memory was 150.8 MB in the beginning and 147.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:16:00,828 INFO L168 Benchmark]: Boogie Preprocessor took 73.22 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 145.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:16:00,828 INFO L168 Benchmark]: RCFGBuilder took 874.48 ms. Allocated memory is still 200.3 MB. Free memory was 145.0 MB in the beginning and 88.8 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:16:00,829 INFO L168 Benchmark]: TraceAbstraction took 19743.10 ms. Allocated memory was 200.3 MB in the beginning and 845.2 MB in the end (delta: 644.9 MB). Free memory was 88.1 MB in the beginning and 219.3 MB in the end (delta: -131.2 MB). Peak memory consumption was 513.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:16:00,833 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.61 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.13 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.3 MB in the beginning and 150.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.58 ms. Allocated memory is still 200.3 MB. Free memory was 150.8 MB in the beginning and 147.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.22 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 145.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.48 ms. Allocated memory is still 200.3 MB. Free memory was 145.0 MB in the beginning and 88.8 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19743.10 ms. Allocated memory was 200.3 MB in the beginning and 845.2 MB in the end (delta: 644.9 MB). Free memory was 88.1 MB in the beginning and 219.3 MB in the end (delta: -131.2 MB). Peak memory consumption was 513.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9685 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1729, ((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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1730, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__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, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) 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, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3742 SDtfs, 3099 SDslu, 8360 SDs, 0 SdLazy, 2566 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29658occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 12606 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 653 ConstructedInterpolants, 0 QuantifiedInterpolants, 136455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...