/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:43:42,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:43:42,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:43:42,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:43:42,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:43:42,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:43:42,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:43:42,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:43:42,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:43:42,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:43:42,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:43:42,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:43:42,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:43:42,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:43:42,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:43:42,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:43:42,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:43:42,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:43:42,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:43:42,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:43:42,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:43:42,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:43:42,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:43:42,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:43:42,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:43:42,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:43:42,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:43:42,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:43:42,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:43:42,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:43:42,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:43:42,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:43:42,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:43:42,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:43:42,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:43:42,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:43:42,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:43:42,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:43:42,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:43:42,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:43:42,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:43:42,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:43:42,097 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:43:42,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:43:42,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:43:42,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:43:42,099 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:43:42,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:43:42,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:43:42,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:43:42,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:43:42,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:43:42,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:43:42,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:43:42,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:43:42,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:43:42,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:43:42,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:43:42,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:43:42,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:43:42,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:43:42,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:43:42,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:43:42,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:43:42,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:43:42,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:43:42,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:43:42,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:43:42,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:43:42,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:43:42,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:43:42,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:43:42,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:43:42,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:43:42,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:43:42,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:43:42,409 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:43:42,410 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i [2019-12-18 20:43:42,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85b410c7/29ea1403c8cf48ffbab95bb035f8f355/FLAG656a4978b [2019-12-18 20:43:43,073 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:43:43,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i [2019-12-18 20:43:43,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85b410c7/29ea1403c8cf48ffbab95bb035f8f355/FLAG656a4978b [2019-12-18 20:43:43,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a85b410c7/29ea1403c8cf48ffbab95bb035f8f355 [2019-12-18 20:43:43,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:43:43,320 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:43:43,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:43:43,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:43:43,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:43:43,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:43:43" (1/1) ... [2019-12-18 20:43:43,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfdf917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:43, skipping insertion in model container [2019-12-18 20:43:43,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:43:43" (1/1) ... [2019-12-18 20:43:43,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:43:43,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:43:43,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:43:43,893 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:43:43,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:43:44,051 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:43:44,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44 WrapperNode [2019-12-18 20:43:44,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:43:44,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:43:44,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:43:44,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:43:44,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (1/1) ... [2019-12-18 20:43:44,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (1/1) ... [2019-12-18 20:43:44,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:43:44,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:43:44,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:43:44,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:43:44,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (1/1) ... [2019-12-18 20:43:44,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (1/1) ... [2019-12-18 20:43:44,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (1/1) ... [2019-12-18 20:43:44,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (1/1) ... [2019-12-18 20:43:44,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (1/1) ... [2019-12-18 20:43:44,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (1/1) ... [2019-12-18 20:43:44,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (1/1) ... [2019-12-18 20:43:44,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:43:44,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:43:44,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:43:44,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:43:44,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (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 20:43:44,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:43:44,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:43:44,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:43:44,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:43:44,260 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:43:44,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:43:44,261 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:43:44,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:43:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:43:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:43:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:43:44,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:43:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:43:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:43:44,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:43:44,266 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 20:43:45,065 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:43:45,066 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:43:45,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:43:45 BoogieIcfgContainer [2019-12-18 20:43:45,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:43:45,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:43:45,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:43:45,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:43:45,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:43:43" (1/3) ... [2019-12-18 20:43:45,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726e9f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:43:45, skipping insertion in model container [2019-12-18 20:43:45,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:44" (2/3) ... [2019-12-18 20:43:45,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726e9f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:43:45, skipping insertion in model container [2019-12-18 20:43:45,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:43:45" (3/3) ... [2019-12-18 20:43:45,077 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_pso.opt.i [2019-12-18 20:43:45,088 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:43:45,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:43:45,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:43:45,098 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:43:45,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,149 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,154 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,154 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,187 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,187 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,188 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,188 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,188 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,219 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,220 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,223 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,223 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,223 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,223 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,223 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,224 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,225 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,225 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,225 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,228 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,229 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,229 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,229 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,229 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,230 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,230 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,230 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,230 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,230 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,237 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,237 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,241 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,250 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,250 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,250 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:45,267 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:43:45,288 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:43:45,288 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:43:45,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:43:45,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:43:45,289 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:43:45,289 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:43:45,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:43:45,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:43:45,310 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 20:43:45,311 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:43:45,403 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:43:45,403 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:43:45,427 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:43:45,455 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:43:45,530 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:43:45,531 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:43:45,539 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:43:45,561 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 20:43:45,562 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:43:49,567 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 20:43:49,723 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 20:43:49,745 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68763 [2019-12-18 20:43:49,745 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 20:43:49,748 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 94 transitions [2019-12-18 20:44:23,309 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 166438 states. [2019-12-18 20:44:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 166438 states. [2019-12-18 20:44:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:44:23,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:23,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:23,318 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:23,324 INFO L82 PathProgramCache]: Analyzing trace with hash 404581936, now seen corresponding path program 1 times [2019-12-18 20:44:23,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:23,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045819553] [2019-12-18 20:44:23,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:44:23,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045819553] [2019-12-18 20:44:23,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:23,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:44:23,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630929813] [2019-12-18 20:44:23,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:44:23,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:23,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:44:23,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:44:23,620 INFO L87 Difference]: Start difference. First operand 166438 states. Second operand 3 states. [2019-12-18 20:44:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:25,413 INFO L93 Difference]: Finished difference Result 163218 states and 783804 transitions. [2019-12-18 20:44:25,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:44:25,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:44:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:31,421 INFO L225 Difference]: With dead ends: 163218 [2019-12-18 20:44:31,422 INFO L226 Difference]: Without dead ends: 153026 [2019-12-18 20:44:31,423 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 20:44:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153026 states. [2019-12-18 20:44:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153026 to 153026. [2019-12-18 20:44:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153026 states. [2019-12-18 20:44:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153026 states to 153026 states and 733880 transitions. [2019-12-18 20:44:47,418 INFO L78 Accepts]: Start accepts. Automaton has 153026 states and 733880 transitions. Word has length 7 [2019-12-18 20:44:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:47,419 INFO L462 AbstractCegarLoop]: Abstraction has 153026 states and 733880 transitions. [2019-12-18 20:44:47,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:44:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 153026 states and 733880 transitions. [2019-12-18 20:44:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:44:47,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:47,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:47,430 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1448601888, now seen corresponding path program 1 times [2019-12-18 20:44:47,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:47,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701187857] [2019-12-18 20:44:47,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:47,509 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 20:44:47,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701187857] [2019-12-18 20:44:47,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:47,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:44:47,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632894887] [2019-12-18 20:44:47,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:44:47,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:47,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:44:47,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:44:47,512 INFO L87 Difference]: Start difference. First operand 153026 states and 733880 transitions. Second operand 3 states. [2019-12-18 20:44:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:44:48,151 INFO L93 Difference]: Finished difference Result 96841 states and 419275 transitions. [2019-12-18 20:44:48,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:44:48,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 20:44:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:44:49,988 INFO L225 Difference]: With dead ends: 96841 [2019-12-18 20:44:49,988 INFO L226 Difference]: Without dead ends: 96841 [2019-12-18 20:44:49,989 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 20:44:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96841 states. [2019-12-18 20:44:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96841 to 96841. [2019-12-18 20:44:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96841 states. [2019-12-18 20:44:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96841 states to 96841 states and 419275 transitions. [2019-12-18 20:44:59,691 INFO L78 Accepts]: Start accepts. Automaton has 96841 states and 419275 transitions. Word has length 15 [2019-12-18 20:44:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:44:59,692 INFO L462 AbstractCegarLoop]: Abstraction has 96841 states and 419275 transitions. [2019-12-18 20:44:59,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:44:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 96841 states and 419275 transitions. [2019-12-18 20:44:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:44:59,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:44:59,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:44:59,696 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:44:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:44:59,697 INFO L82 PathProgramCache]: Analyzing trace with hash 576667599, now seen corresponding path program 1 times [2019-12-18 20:44:59,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:44:59,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105367595] [2019-12-18 20:44:59,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:44:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:44:59,806 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 20:44:59,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105367595] [2019-12-18 20:44:59,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:44:59,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:44:59,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879110363] [2019-12-18 20:44:59,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:44:59,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:44:59,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:44:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:44:59,809 INFO L87 Difference]: Start difference. First operand 96841 states and 419275 transitions. Second operand 4 states. [2019-12-18 20:45:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:00,816 INFO L93 Difference]: Finished difference Result 146922 states and 610245 transitions. [2019-12-18 20:45:00,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:45:00,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:45:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:01,230 INFO L225 Difference]: With dead ends: 146922 [2019-12-18 20:45:01,230 INFO L226 Difference]: Without dead ends: 146817 [2019-12-18 20:45:01,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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 20:45:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146817 states. [2019-12-18 20:45:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146817 to 132421. [2019-12-18 20:45:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132421 states. [2019-12-18 20:45:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132421 states to 132421 states and 557528 transitions. [2019-12-18 20:45:12,754 INFO L78 Accepts]: Start accepts. Automaton has 132421 states and 557528 transitions. Word has length 15 [2019-12-18 20:45:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:12,755 INFO L462 AbstractCegarLoop]: Abstraction has 132421 states and 557528 transitions. [2019-12-18 20:45:12,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:45:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 132421 states and 557528 transitions. [2019-12-18 20:45:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:45:12,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:12,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:12,759 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:12,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1043569302, now seen corresponding path program 1 times [2019-12-18 20:45:12,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:12,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017308981] [2019-12-18 20:45:12,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:12,846 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 20:45:12,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017308981] [2019-12-18 20:45:12,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:12,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:45:12,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590215065] [2019-12-18 20:45:12,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:45:12,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:45:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:45:12,848 INFO L87 Difference]: Start difference. First operand 132421 states and 557528 transitions. Second operand 4 states. [2019-12-18 20:45:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:13,066 INFO L93 Difference]: Finished difference Result 36987 states and 132370 transitions. [2019-12-18 20:45:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:45:13,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:45:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:13,136 INFO L225 Difference]: With dead ends: 36987 [2019-12-18 20:45:13,136 INFO L226 Difference]: Without dead ends: 36987 [2019-12-18 20:45:13,137 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 20:45:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36987 states. [2019-12-18 20:45:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36987 to 36987. [2019-12-18 20:45:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36987 states. [2019-12-18 20:45:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36987 states to 36987 states and 132370 transitions. [2019-12-18 20:45:13,787 INFO L78 Accepts]: Start accepts. Automaton has 36987 states and 132370 transitions. Word has length 16 [2019-12-18 20:45:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:13,787 INFO L462 AbstractCegarLoop]: Abstraction has 36987 states and 132370 transitions. [2019-12-18 20:45:13,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:45:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 36987 states and 132370 transitions. [2019-12-18 20:45:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:45:13,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:13,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:13,791 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash 372623930, now seen corresponding path program 1 times [2019-12-18 20:45:13,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:13,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148230941] [2019-12-18 20:45:13,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:13,876 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 20:45:13,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148230941] [2019-12-18 20:45:13,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:13,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:45:13,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506616655] [2019-12-18 20:45:13,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:45:13,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:45:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:45:13,879 INFO L87 Difference]: Start difference. First operand 36987 states and 132370 transitions. Second operand 5 states. [2019-12-18 20:45:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:15,737 INFO L93 Difference]: Finished difference Result 54351 states and 190541 transitions. [2019-12-18 20:45:15,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:45:15,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 20:45:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:15,854 INFO L225 Difference]: With dead ends: 54351 [2019-12-18 20:45:15,854 INFO L226 Difference]: Without dead ends: 54333 [2019-12-18 20:45:15,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:45:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54333 states. [2019-12-18 20:45:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54333 to 42478. [2019-12-18 20:45:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42478 states. [2019-12-18 20:45:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42478 states to 42478 states and 151468 transitions. [2019-12-18 20:45:16,699 INFO L78 Accepts]: Start accepts. Automaton has 42478 states and 151468 transitions. Word has length 16 [2019-12-18 20:45:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:16,700 INFO L462 AbstractCegarLoop]: Abstraction has 42478 states and 151468 transitions. [2019-12-18 20:45:16,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:45:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 42478 states and 151468 transitions. [2019-12-18 20:45:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:45:16,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:16,716 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] [2019-12-18 20:45:16,716 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash -351800871, now seen corresponding path program 1 times [2019-12-18 20:45:16,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:16,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489461583] [2019-12-18 20:45:16,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:16,830 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 20:45:16,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489461583] [2019-12-18 20:45:16,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:16,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:45:16,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466722015] [2019-12-18 20:45:16,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:45:16,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:45:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:45:16,832 INFO L87 Difference]: Start difference. First operand 42478 states and 151468 transitions. Second operand 6 states. [2019-12-18 20:45:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:18,846 INFO L93 Difference]: Finished difference Result 63900 states and 221523 transitions. [2019-12-18 20:45:18,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:45:18,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 20:45:18,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:18,975 INFO L225 Difference]: With dead ends: 63900 [2019-12-18 20:45:18,975 INFO L226 Difference]: Without dead ends: 63870 [2019-12-18 20:45:18,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:45:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-18 20:45:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 42427. [2019-12-18 20:45:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42427 states. [2019-12-18 20:45:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42427 states to 42427 states and 150408 transitions. [2019-12-18 20:45:19,891 INFO L78 Accepts]: Start accepts. Automaton has 42427 states and 150408 transitions. Word has length 24 [2019-12-18 20:45:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:19,892 INFO L462 AbstractCegarLoop]: Abstraction has 42427 states and 150408 transitions. [2019-12-18 20:45:19,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:45:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 42427 states and 150408 transitions. [2019-12-18 20:45:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:45:19,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:19,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:19,915 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:19,915 INFO L82 PathProgramCache]: Analyzing trace with hash -478348385, now seen corresponding path program 1 times [2019-12-18 20:45:19,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:19,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255732913] [2019-12-18 20:45:19,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:19,998 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 20:45:19,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255732913] [2019-12-18 20:45:19,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:19,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:45:19,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165334481] [2019-12-18 20:45:20,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:45:20,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:20,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:45:20,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:45:20,001 INFO L87 Difference]: Start difference. First operand 42427 states and 150408 transitions. Second operand 5 states. [2019-12-18 20:45:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:20,123 INFO L93 Difference]: Finished difference Result 22700 states and 81312 transitions. [2019-12-18 20:45:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:45:20,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:45:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:20,166 INFO L225 Difference]: With dead ends: 22700 [2019-12-18 20:45:20,166 INFO L226 Difference]: Without dead ends: 22700 [2019-12-18 20:45:20,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:45:20,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22700 states. [2019-12-18 20:45:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22700 to 22364. [2019-12-18 20:45:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22364 states. [2019-12-18 20:45:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22364 states to 22364 states and 80168 transitions. [2019-12-18 20:45:23,015 INFO L78 Accepts]: Start accepts. Automaton has 22364 states and 80168 transitions. Word has length 28 [2019-12-18 20:45:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:23,015 INFO L462 AbstractCegarLoop]: Abstraction has 22364 states and 80168 transitions. [2019-12-18 20:45:23,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:45:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 22364 states and 80168 transitions. [2019-12-18 20:45:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:45:23,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:23,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:23,054 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:23,054 INFO L82 PathProgramCache]: Analyzing trace with hash -89817491, now seen corresponding path program 1 times [2019-12-18 20:45:23,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:23,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110155011] [2019-12-18 20:45:23,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:23,116 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 20:45:23,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110155011] [2019-12-18 20:45:23,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:23,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:45:23,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491671269] [2019-12-18 20:45:23,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:45:23,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:23,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:45:23,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:45:23,119 INFO L87 Difference]: Start difference. First operand 22364 states and 80168 transitions. Second operand 3 states. [2019-12-18 20:45:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:23,314 INFO L93 Difference]: Finished difference Result 33735 states and 115366 transitions. [2019-12-18 20:45:23,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:45:23,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 20:45:23,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:23,371 INFO L225 Difference]: With dead ends: 33735 [2019-12-18 20:45:23,371 INFO L226 Difference]: Without dead ends: 22811 [2019-12-18 20:45:23,372 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 20:45:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22811 states. [2019-12-18 20:45:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22811 to 22329. [2019-12-18 20:45:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22329 states. [2019-12-18 20:45:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22329 states to 22329 states and 69880 transitions. [2019-12-18 20:45:23,746 INFO L78 Accepts]: Start accepts. Automaton has 22329 states and 69880 transitions. Word has length 42 [2019-12-18 20:45:23,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:23,747 INFO L462 AbstractCegarLoop]: Abstraction has 22329 states and 69880 transitions. [2019-12-18 20:45:23,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:45:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 22329 states and 69880 transitions. [2019-12-18 20:45:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 20:45:23,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:23,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:23,778 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1643728433, now seen corresponding path program 1 times [2019-12-18 20:45:23,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:23,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877697759] [2019-12-18 20:45:23,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:23,852 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 20:45:23,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877697759] [2019-12-18 20:45:23,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:23,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:45:23,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135341648] [2019-12-18 20:45:23,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:45:23,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:23,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:45:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:45:23,855 INFO L87 Difference]: Start difference. First operand 22329 states and 69880 transitions. Second operand 6 states. [2019-12-18 20:45:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:23,973 INFO L93 Difference]: Finished difference Result 21070 states and 66665 transitions. [2019-12-18 20:45:23,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:45:23,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 20:45:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:23,989 INFO L225 Difference]: With dead ends: 21070 [2019-12-18 20:45:23,989 INFO L226 Difference]: Without dead ends: 10890 [2019-12-18 20:45:23,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:45:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-12-18 20:45:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 10414. [2019-12-18 20:45:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-18 20:45:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 32808 transitions. [2019-12-18 20:45:24,161 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 32808 transitions. Word has length 43 [2019-12-18 20:45:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:24,161 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 32808 transitions. [2019-12-18 20:45:24,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:45:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 32808 transitions. [2019-12-18 20:45:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:24,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:24,180 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] [2019-12-18 20:45:24,180 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash -400777059, now seen corresponding path program 1 times [2019-12-18 20:45:24,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:24,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404048446] [2019-12-18 20:45:24,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:24,266 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 20:45:24,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404048446] [2019-12-18 20:45:24,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:24,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:45:24,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528664138] [2019-12-18 20:45:24,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:45:24,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:24,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:45:24,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:45:24,268 INFO L87 Difference]: Start difference. First operand 10414 states and 32808 transitions. Second operand 4 states. [2019-12-18 20:45:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:24,332 INFO L93 Difference]: Finished difference Result 18914 states and 59584 transitions. [2019-12-18 20:45:24,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:45:24,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 20:45:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:24,345 INFO L225 Difference]: With dead ends: 18914 [2019-12-18 20:45:24,345 INFO L226 Difference]: Without dead ends: 8811 [2019-12-18 20:45:24,346 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 20:45:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8811 states. [2019-12-18 20:45:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8811 to 8811. [2019-12-18 20:45:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-18 20:45:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 27635 transitions. [2019-12-18 20:45:24,685 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 27635 transitions. Word has length 57 [2019-12-18 20:45:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:24,685 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 27635 transitions. [2019-12-18 20:45:24,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:45:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 27635 transitions. [2019-12-18 20:45:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:24,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:24,696 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] [2019-12-18 20:45:24,696 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:24,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:24,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2006827895, now seen corresponding path program 2 times [2019-12-18 20:45:24,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:24,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697959901] [2019-12-18 20:45:24,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:24,786 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 20:45:24,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697959901] [2019-12-18 20:45:24,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:24,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:45:24,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684612395] [2019-12-18 20:45:24,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:45:24,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:24,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:45:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:45:24,789 INFO L87 Difference]: Start difference. First operand 8811 states and 27635 transitions. Second operand 7 states. [2019-12-18 20:45:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:25,152 INFO L93 Difference]: Finished difference Result 23195 states and 72754 transitions. [2019-12-18 20:45:25,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:45:25,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:45:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:25,187 INFO L225 Difference]: With dead ends: 23195 [2019-12-18 20:45:25,187 INFO L226 Difference]: Without dead ends: 17949 [2019-12-18 20:45:25,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:45:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17949 states. [2019-12-18 20:45:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17949 to 10607. [2019-12-18 20:45:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10607 states. [2019-12-18 20:45:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 33546 transitions. [2019-12-18 20:45:25,432 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 33546 transitions. Word has length 57 [2019-12-18 20:45:25,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:25,432 INFO L462 AbstractCegarLoop]: Abstraction has 10607 states and 33546 transitions. [2019-12-18 20:45:25,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:45:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 33546 transitions. [2019-12-18 20:45:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:25,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:25,444 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] [2019-12-18 20:45:25,444 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:25,444 INFO L82 PathProgramCache]: Analyzing trace with hash 716545355, now seen corresponding path program 3 times [2019-12-18 20:45:25,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:25,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624364851] [2019-12-18 20:45:25,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:25,550 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 20:45:25,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624364851] [2019-12-18 20:45:25,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:25,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:45:25,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392532629] [2019-12-18 20:45:25,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:45:25,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:45:25,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:45:25,552 INFO L87 Difference]: Start difference. First operand 10607 states and 33546 transitions. Second operand 8 states. [2019-12-18 20:45:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:26,592 INFO L93 Difference]: Finished difference Result 44112 states and 139302 transitions. [2019-12-18 20:45:26,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:45:26,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 20:45:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:26,642 INFO L225 Difference]: With dead ends: 44112 [2019-12-18 20:45:26,642 INFO L226 Difference]: Without dead ends: 31559 [2019-12-18 20:45:26,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:45:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31559 states. [2019-12-18 20:45:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31559 to 13319. [2019-12-18 20:45:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13319 states. [2019-12-18 20:45:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 42674 transitions. [2019-12-18 20:45:26,980 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 42674 transitions. Word has length 57 [2019-12-18 20:45:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:26,981 INFO L462 AbstractCegarLoop]: Abstraction has 13319 states and 42674 transitions. [2019-12-18 20:45:26,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:45:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 42674 transitions. [2019-12-18 20:45:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:26,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:26,997 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] [2019-12-18 20:45:26,998 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:26,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:26,998 INFO L82 PathProgramCache]: Analyzing trace with hash -747821109, now seen corresponding path program 1 times [2019-12-18 20:45:26,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:26,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213208400] [2019-12-18 20:45:26,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:27,053 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 20:45:27,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213208400] [2019-12-18 20:45:27,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:27,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:45:27,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641041836] [2019-12-18 20:45:27,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:45:27,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:27,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:45:27,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:45:27,056 INFO L87 Difference]: Start difference. First operand 13319 states and 42674 transitions. Second operand 3 states. [2019-12-18 20:45:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:27,147 INFO L93 Difference]: Finished difference Result 18060 states and 57175 transitions. [2019-12-18 20:45:27,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:45:27,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:45:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:27,359 INFO L225 Difference]: With dead ends: 18060 [2019-12-18 20:45:27,360 INFO L226 Difference]: Without dead ends: 18060 [2019-12-18 20:45:27,360 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 20:45:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18060 states. [2019-12-18 20:45:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18060 to 15832. [2019-12-18 20:45:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15832 states. [2019-12-18 20:45:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15832 states to 15832 states and 50778 transitions. [2019-12-18 20:45:27,623 INFO L78 Accepts]: Start accepts. Automaton has 15832 states and 50778 transitions. Word has length 57 [2019-12-18 20:45:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:27,623 INFO L462 AbstractCegarLoop]: Abstraction has 15832 states and 50778 transitions. [2019-12-18 20:45:27,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:45:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 15832 states and 50778 transitions. [2019-12-18 20:45:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:27,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:27,648 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] [2019-12-18 20:45:27,648 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash -780825525, now seen corresponding path program 4 times [2019-12-18 20:45:27,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:27,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357299280] [2019-12-18 20:45:27,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:27,784 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 20:45:27,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357299280] [2019-12-18 20:45:27,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:27,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:45:27,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47341172] [2019-12-18 20:45:27,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:45:27,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:27,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:45:27,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:45:27,786 INFO L87 Difference]: Start difference. First operand 15832 states and 50778 transitions. Second operand 9 states. [2019-12-18 20:45:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:29,246 INFO L93 Difference]: Finished difference Result 60662 states and 186954 transitions. [2019-12-18 20:45:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:45:29,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 20:45:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:29,336 INFO L225 Difference]: With dead ends: 60662 [2019-12-18 20:45:29,337 INFO L226 Difference]: Without dead ends: 56362 [2019-12-18 20:45:29,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2019-12-18 20:45:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56362 states. [2019-12-18 20:45:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56362 to 16687. [2019-12-18 20:45:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16687 states. [2019-12-18 20:45:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16687 states to 16687 states and 53640 transitions. [2019-12-18 20:45:29,882 INFO L78 Accepts]: Start accepts. Automaton has 16687 states and 53640 transitions. Word has length 57 [2019-12-18 20:45:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:29,883 INFO L462 AbstractCegarLoop]: Abstraction has 16687 states and 53640 transitions. [2019-12-18 20:45:29,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:45:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 16687 states and 53640 transitions. [2019-12-18 20:45:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:29,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:29,901 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] [2019-12-18 20:45:29,901 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1562304933, now seen corresponding path program 5 times [2019-12-18 20:45:29,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:29,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675035632] [2019-12-18 20:45:29,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:30,166 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 20:45:30,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675035632] [2019-12-18 20:45:30,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:30,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:45:30,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069542868] [2019-12-18 20:45:30,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:45:30,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:45:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:45:30,169 INFO L87 Difference]: Start difference. First operand 16687 states and 53640 transitions. Second operand 9 states. [2019-12-18 20:45:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:31,535 INFO L93 Difference]: Finished difference Result 48042 states and 147444 transitions. [2019-12-18 20:45:31,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:45:31,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 20:45:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:31,596 INFO L225 Difference]: With dead ends: 48042 [2019-12-18 20:45:31,597 INFO L226 Difference]: Without dead ends: 41776 [2019-12-18 20:45:31,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-12-18 20:45:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41776 states. [2019-12-18 20:45:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41776 to 15886. [2019-12-18 20:45:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15886 states. [2019-12-18 20:45:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 51044 transitions. [2019-12-18 20:45:32,038 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 51044 transitions. Word has length 57 [2019-12-18 20:45:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:32,039 INFO L462 AbstractCegarLoop]: Abstraction has 15886 states and 51044 transitions. [2019-12-18 20:45:32,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:45:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 51044 transitions. [2019-12-18 20:45:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:32,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:32,057 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] [2019-12-18 20:45:32,057 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:32,057 INFO L82 PathProgramCache]: Analyzing trace with hash -414013221, now seen corresponding path program 6 times [2019-12-18 20:45:32,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:32,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646930793] [2019-12-18 20:45:32,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:32,150 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 20:45:32,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646930793] [2019-12-18 20:45:32,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:32,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:45:32,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035126256] [2019-12-18 20:45:32,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:45:32,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:32,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:45:32,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:45:32,154 INFO L87 Difference]: Start difference. First operand 15886 states and 51044 transitions. Second operand 7 states. [2019-12-18 20:45:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:32,516 INFO L93 Difference]: Finished difference Result 32290 states and 101146 transitions. [2019-12-18 20:45:32,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:45:32,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:45:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:32,557 INFO L225 Difference]: With dead ends: 32290 [2019-12-18 20:45:32,557 INFO L226 Difference]: Without dead ends: 27252 [2019-12-18 20:45:32,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:45:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27252 states. [2019-12-18 20:45:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27252 to 16096. [2019-12-18 20:45:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16096 states. [2019-12-18 20:45:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16096 states to 16096 states and 51631 transitions. [2019-12-18 20:45:33,058 INFO L78 Accepts]: Start accepts. Automaton has 16096 states and 51631 transitions. Word has length 57 [2019-12-18 20:45:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:33,058 INFO L462 AbstractCegarLoop]: Abstraction has 16096 states and 51631 transitions. [2019-12-18 20:45:33,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:45:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 16096 states and 51631 transitions. [2019-12-18 20:45:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:33,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:33,077 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] [2019-12-18 20:45:33,077 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:33,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1111165587, now seen corresponding path program 7 times [2019-12-18 20:45:33,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:33,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538265200] [2019-12-18 20:45:33,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:33,166 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 20:45:33,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538265200] [2019-12-18 20:45:33,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:33,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:45:33,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538729914] [2019-12-18 20:45:33,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:45:33,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:33,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:45:33,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:45:33,168 INFO L87 Difference]: Start difference. First operand 16096 states and 51631 transitions. Second operand 5 states. [2019-12-18 20:45:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:33,653 INFO L93 Difference]: Finished difference Result 24102 states and 75006 transitions. [2019-12-18 20:45:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:45:33,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 20:45:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:33,689 INFO L225 Difference]: With dead ends: 24102 [2019-12-18 20:45:33,689 INFO L226 Difference]: Without dead ends: 23976 [2019-12-18 20:45:33,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 20:45:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23976 states. [2019-12-18 20:45:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23976 to 19024. [2019-12-18 20:45:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19024 states. [2019-12-18 20:45:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19024 states to 19024 states and 60429 transitions. [2019-12-18 20:45:34,014 INFO L78 Accepts]: Start accepts. Automaton has 19024 states and 60429 transitions. Word has length 57 [2019-12-18 20:45:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:34,014 INFO L462 AbstractCegarLoop]: Abstraction has 19024 states and 60429 transitions. [2019-12-18 20:45:34,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:45:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 19024 states and 60429 transitions. [2019-12-18 20:45:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:34,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:34,037 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] [2019-12-18 20:45:34,037 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:34,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1189678611, now seen corresponding path program 8 times [2019-12-18 20:45:34,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:34,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618551368] [2019-12-18 20:45:34,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:34,148 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 20:45:34,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618551368] [2019-12-18 20:45:34,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:34,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:45:34,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103089302] [2019-12-18 20:45:34,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:45:34,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:34,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:45:34,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:45:34,150 INFO L87 Difference]: Start difference. First operand 19024 states and 60429 transitions. Second operand 5 states. [2019-12-18 20:45:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:34,631 INFO L93 Difference]: Finished difference Result 25682 states and 80014 transitions. [2019-12-18 20:45:34,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:45:34,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 20:45:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:34,670 INFO L225 Difference]: With dead ends: 25682 [2019-12-18 20:45:34,670 INFO L226 Difference]: Without dead ends: 25499 [2019-12-18 20:45:34,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:45:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25499 states. [2019-12-18 20:45:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25499 to 22650. [2019-12-18 20:45:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22650 states. [2019-12-18 20:45:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22650 states to 22650 states and 71520 transitions. [2019-12-18 20:45:35,042 INFO L78 Accepts]: Start accepts. Automaton has 22650 states and 71520 transitions. Word has length 57 [2019-12-18 20:45:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:35,042 INFO L462 AbstractCegarLoop]: Abstraction has 22650 states and 71520 transitions. [2019-12-18 20:45:35,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:45:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 22650 states and 71520 transitions. [2019-12-18 20:45:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:35,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:35,071 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] [2019-12-18 20:45:35,071 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1103228865, now seen corresponding path program 9 times [2019-12-18 20:45:35,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:35,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721946811] [2019-12-18 20:45:35,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:35,358 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 20:45:35,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721946811] [2019-12-18 20:45:35,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:35,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:45:35,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267267074] [2019-12-18 20:45:35,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:45:35,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:35,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:45:35,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:45:35,360 INFO L87 Difference]: Start difference. First operand 22650 states and 71520 transitions. Second operand 6 states. [2019-12-18 20:45:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:36,044 INFO L93 Difference]: Finished difference Result 28892 states and 89312 transitions. [2019-12-18 20:45:36,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:45:36,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 20:45:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:36,086 INFO L225 Difference]: With dead ends: 28892 [2019-12-18 20:45:36,086 INFO L226 Difference]: Without dead ends: 28703 [2019-12-18 20:45:36,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:45:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28703 states. [2019-12-18 20:45:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28703 to 23678. [2019-12-18 20:45:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23678 states. [2019-12-18 20:45:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23678 states to 23678 states and 74490 transitions. [2019-12-18 20:45:36,479 INFO L78 Accepts]: Start accepts. Automaton has 23678 states and 74490 transitions. Word has length 57 [2019-12-18 20:45:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:36,480 INFO L462 AbstractCegarLoop]: Abstraction has 23678 states and 74490 transitions. [2019-12-18 20:45:36,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:45:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 23678 states and 74490 transitions. [2019-12-18 20:45:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:36,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:36,509 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] [2019-12-18 20:45:36,510 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:36,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:36,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1047376819, now seen corresponding path program 10 times [2019-12-18 20:45:36,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:36,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290539875] [2019-12-18 20:45:36,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:45:36,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290539875] [2019-12-18 20:45:36,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:36,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:45:36,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81868665] [2019-12-18 20:45:36,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:45:36,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:45:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:45:36,698 INFO L87 Difference]: Start difference. First operand 23678 states and 74490 transitions. Second operand 10 states. [2019-12-18 20:45:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:38,347 INFO L93 Difference]: Finished difference Result 35794 states and 108163 transitions. [2019-12-18 20:45:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:45:38,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-18 20:45:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:38,400 INFO L225 Difference]: With dead ends: 35794 [2019-12-18 20:45:38,400 INFO L226 Difference]: Without dead ends: 35612 [2019-12-18 20:45:38,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:45:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35612 states. [2019-12-18 20:45:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35612 to 23637. [2019-12-18 20:45:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23637 states. [2019-12-18 20:45:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23637 states to 23637 states and 72959 transitions. [2019-12-18 20:45:39,044 INFO L78 Accepts]: Start accepts. Automaton has 23637 states and 72959 transitions. Word has length 57 [2019-12-18 20:45:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:39,045 INFO L462 AbstractCegarLoop]: Abstraction has 23637 states and 72959 transitions. [2019-12-18 20:45:39,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:45:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 23637 states and 72959 transitions. [2019-12-18 20:45:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:39,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:39,073 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] [2019-12-18 20:45:39,073 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:39,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:39,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2105231561, now seen corresponding path program 11 times [2019-12-18 20:45:39,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:39,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225773119] [2019-12-18 20:45:39,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:39,211 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 20:45:39,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225773119] [2019-12-18 20:45:39,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:39,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:45:39,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82302135] [2019-12-18 20:45:39,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:45:39,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:45:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:45:39,213 INFO L87 Difference]: Start difference. First operand 23637 states and 72959 transitions. Second operand 9 states. [2019-12-18 20:45:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:41,037 INFO L93 Difference]: Finished difference Result 33879 states and 101490 transitions. [2019-12-18 20:45:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 20:45:41,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 20:45:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:41,086 INFO L225 Difference]: With dead ends: 33879 [2019-12-18 20:45:41,087 INFO L226 Difference]: Without dead ends: 33879 [2019-12-18 20:45:41,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:45:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33879 states. [2019-12-18 20:45:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33879 to 22356. [2019-12-18 20:45:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22356 states. [2019-12-18 20:45:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22356 states to 22356 states and 69036 transitions. [2019-12-18 20:45:41,515 INFO L78 Accepts]: Start accepts. Automaton has 22356 states and 69036 transitions. Word has length 57 [2019-12-18 20:45:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:41,515 INFO L462 AbstractCegarLoop]: Abstraction has 22356 states and 69036 transitions. [2019-12-18 20:45:41,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:45:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22356 states and 69036 transitions. [2019-12-18 20:45:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:41,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:41,538 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] [2019-12-18 20:45:41,539 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:41,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash -87684039, now seen corresponding path program 12 times [2019-12-18 20:45:41,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:41,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248917665] [2019-12-18 20:45:41,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:45:41,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248917665] [2019-12-18 20:45:41,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:41,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:45:41,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841721278] [2019-12-18 20:45:41,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:45:41,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:41,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:45:41,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:45:41,668 INFO L87 Difference]: Start difference. First operand 22356 states and 69036 transitions. Second operand 8 states. [2019-12-18 20:45:42,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:42,952 INFO L93 Difference]: Finished difference Result 39184 states and 118203 transitions. [2019-12-18 20:45:42,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:45:42,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 20:45:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:43,010 INFO L225 Difference]: With dead ends: 39184 [2019-12-18 20:45:43,010 INFO L226 Difference]: Without dead ends: 39086 [2019-12-18 20:45:43,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:45:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39086 states. [2019-12-18 20:45:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39086 to 21993. [2019-12-18 20:45:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21993 states. [2019-12-18 20:45:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21993 states to 21993 states and 67832 transitions. [2019-12-18 20:45:43,479 INFO L78 Accepts]: Start accepts. Automaton has 21993 states and 67832 transitions. Word has length 57 [2019-12-18 20:45:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:43,479 INFO L462 AbstractCegarLoop]: Abstraction has 21993 states and 67832 transitions. [2019-12-18 20:45:43,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:45:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 21993 states and 67832 transitions. [2019-12-18 20:45:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:45:43,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:43,504 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] [2019-12-18 20:45:43,504 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash 769055305, now seen corresponding path program 13 times [2019-12-18 20:45:43,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:43,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918332329] [2019-12-18 20:45:43,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:43,574 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 20:45:43,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918332329] [2019-12-18 20:45:43,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:43,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:45:43,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623223047] [2019-12-18 20:45:43,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:45:43,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:43,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:45:43,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:45:43,576 INFO L87 Difference]: Start difference. First operand 21993 states and 67832 transitions. Second operand 3 states. [2019-12-18 20:45:43,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:43,698 INFO L93 Difference]: Finished difference Result 21993 states and 67830 transitions. [2019-12-18 20:45:43,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:45:43,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:45:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:43,755 INFO L225 Difference]: With dead ends: 21993 [2019-12-18 20:45:43,755 INFO L226 Difference]: Without dead ends: 21993 [2019-12-18 20:45:43,756 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 20:45:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21993 states. [2019-12-18 20:45:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21993 to 19974. [2019-12-18 20:45:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19974 states. [2019-12-18 20:45:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19974 states to 19974 states and 62399 transitions. [2019-12-18 20:45:44,297 INFO L78 Accepts]: Start accepts. Automaton has 19974 states and 62399 transitions. Word has length 57 [2019-12-18 20:45:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:44,298 INFO L462 AbstractCegarLoop]: Abstraction has 19974 states and 62399 transitions. [2019-12-18 20:45:44,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:45:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19974 states and 62399 transitions. [2019-12-18 20:45:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:45:44,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:44,329 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] [2019-12-18 20:45:44,329 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1000017382, now seen corresponding path program 1 times [2019-12-18 20:45:44,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:44,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315491293] [2019-12-18 20:45:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:44,428 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 20:45:44,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315491293] [2019-12-18 20:45:44,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:44,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:45:44,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862844060] [2019-12-18 20:45:44,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:45:44,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:45:44,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:45:44,430 INFO L87 Difference]: Start difference. First operand 19974 states and 62399 transitions. Second operand 3 states. [2019-12-18 20:45:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:44,491 INFO L93 Difference]: Finished difference Result 15438 states and 47829 transitions. [2019-12-18 20:45:44,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:45:44,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 20:45:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:44,511 INFO L225 Difference]: With dead ends: 15438 [2019-12-18 20:45:44,511 INFO L226 Difference]: Without dead ends: 15438 [2019-12-18 20:45:44,512 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 20:45:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15438 states. [2019-12-18 20:45:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15438 to 15043. [2019-12-18 20:45:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15043 states. [2019-12-18 20:45:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 46622 transitions. [2019-12-18 20:45:44,838 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 46622 transitions. Word has length 58 [2019-12-18 20:45:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:45:44,838 INFO L462 AbstractCegarLoop]: Abstraction has 15043 states and 46622 transitions. [2019-12-18 20:45:44,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:45:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 46622 transitions. [2019-12-18 20:45:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:45:44,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:44,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:44,853 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:44,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1487548287, now seen corresponding path program 1 times [2019-12-18 20:45:44,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:44,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767636808] [2019-12-18 20:45:44,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:45:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:45:44,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:45:44,979 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:45:44,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t613~0.base_27|)) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_20) (= v_~y~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_18 0) (= 0 v_~y$w_buff1~0_24) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t613~0.base_27| 4)) (= v_~a~0_11 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_71 0) (= 0 |v_ULTIMATE.start_main_~#t613~0.offset_20|) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~weak$$choice2~0_34) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd3~0_28 0) (= v_~y$r_buff0_thd4~0_21 0) (= 0 v_~y$flush_delayed~0_13) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd0~0_20 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t613~0.base_27| 1)) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t613~0.base_27| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t613~0.base_27|) |v_ULTIMATE.start_main_~#t613~0.offset_20| 0)) |v_#memory_int_29|) (= v_~x~0_18 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~y$w_buff0_used~0_106 0) (= 0 v_~__unbuffered_p3_EBX~0_15) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t613~0.base_27|) (= 0 v_~y$w_buff0~0_25) (= |v_#NULL.offset_4| 0) (= v_~y$mem_tmp~0_10 0) (= 0 v_~y$r_buff1_thd2~0_42) (= 0 v_~y$r_buff1_thd4~0_18))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t615~0.offset=|v_ULTIMATE.start_main_~#t615~0.offset_20|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ULTIMATE.start_main_~#t616~0.base=|v_ULTIMATE.start_main_~#t616~0.base_19|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t613~0.base=|v_ULTIMATE.start_main_~#t613~0.base_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_71, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_18, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t615~0.base=|v_ULTIMATE.start_main_~#t615~0.base_27|, ULTIMATE.start_main_~#t616~0.offset=|v_ULTIMATE.start_main_~#t616~0.offset_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t613~0.offset=|v_ULTIMATE.start_main_~#t613~0.offset_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_71|, ULTIMATE.start_main_~#t614~0.offset=|v_ULTIMATE.start_main_~#t614~0.offset_20|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_18, ULTIMATE.start_main_~#t614~0.base=|v_ULTIMATE.start_main_~#t614~0.base_27|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t615~0.offset, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t616~0.base, #NULL.offset, ULTIMATE.start_main_~#t613~0.base, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t615~0.base, ULTIMATE.start_main_~#t616~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t613~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ULTIMATE.start_main_~#t614~0.offset, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t614~0.base, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:45:44,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t614~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t614~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t614~0.base_12|) |v_ULTIMATE.start_main_~#t614~0.offset_10| 1)) |v_#memory_int_17|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t614~0.base_12| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t614~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t614~0.base_12| 4) |v_#length_19|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t614~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t614~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t614~0.offset=|v_ULTIMATE.start_main_~#t614~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t614~0.base=|v_ULTIMATE.start_main_~#t614~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t614~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t614~0.base] because there is no mapped edge [2019-12-18 20:45:44,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L848-1-->L850: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t615~0.base_13|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t615~0.base_13|) 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t615~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t615~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t615~0.base_13|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t615~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t615~0.base_13|) |v_ULTIMATE.start_main_~#t615~0.offset_11| 2)) |v_#memory_int_21|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t615~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t615~0.base=|v_ULTIMATE.start_main_~#t615~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t615~0.offset=|v_ULTIMATE.start_main_~#t615~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t615~0.base, ULTIMATE.start_main_~#t615~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:45:44,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd3~0_17 1) (= 1 v_~z~0_6) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff0_thd2~0_46 v_~y$r_buff1_thd2~0_26) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_11) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_11) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:45:44,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L850-1-->L852: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t616~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t616~0.base_10|) |v_ULTIMATE.start_main_~#t616~0.offset_10| 3)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t616~0.base_10| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t616~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t616~0.offset_10| 0) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t616~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t616~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t616~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t616~0.offset=|v_ULTIMATE.start_main_~#t616~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t616~0.base=|v_ULTIMATE.start_main_~#t616~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t616~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, ULTIMATE.start_main_~#t616~0.base, #length] because there is no mapped edge [2019-12-18 20:45:44,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~a~0_6) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:45:44,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd4~0_In-56705953 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-56705953 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-56705953 |P3Thread1of1ForFork0_#t~ite32_Out-56705953|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-56705953 |P3Thread1of1ForFork0_#t~ite32_Out-56705953|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-56705953, ~y$w_buff1~0=~y$w_buff1~0_In-56705953, ~y~0=~y~0_In-56705953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-56705953} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-56705953, ~y$w_buff1~0=~y$w_buff1~0_In-56705953, ~y~0=~y~0_In-56705953, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-56705953|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-56705953} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:45:44,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_17 |v_P3Thread1of1ForFork0_#t~ite32_8|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_8|} OutVars{~y~0=v_~y~0_17, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_7|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_7|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:45:44,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In930712794 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In930712794 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out930712794| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out930712794| ~y$w_buff0_used~0_In930712794)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In930712794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In930712794} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In930712794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In930712794, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out930712794|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 20:45:44,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In644286153 256)))) (or (and (not .cse0) (= ~y$w_buff0~0_In644286153 |P1Thread1of1ForFork2_#t~ite9_Out644286153|) (= |P1Thread1of1ForFork2_#t~ite8_In644286153| |P1Thread1of1ForFork2_#t~ite8_Out644286153|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In644286153 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In644286153 256)) (and (= (mod ~y$r_buff1_thd2~0_In644286153 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In644286153 256) 0) .cse1))) .cse0 (= ~y$w_buff0~0_In644286153 |P1Thread1of1ForFork2_#t~ite8_Out644286153|) (= |P1Thread1of1ForFork2_#t~ite9_Out644286153| |P1Thread1of1ForFork2_#t~ite8_Out644286153|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In644286153, ~y$w_buff0_used~0=~y$w_buff0_used~0_In644286153, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In644286153|, ~y$w_buff0~0=~y$w_buff0~0_In644286153, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In644286153, ~weak$$choice2~0=~weak$$choice2~0_In644286153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In644286153} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In644286153, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out644286153|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In644286153, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out644286153|, ~y$w_buff0~0=~y$w_buff0~0_In644286153, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In644286153, ~weak$$choice2~0=~weak$$choice2~0_In644286153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In644286153} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 20:45:44,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-87701396 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In-87701396 |P1Thread1of1ForFork2_#t~ite14_Out-87701396|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-87701396 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-87701396 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In-87701396 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-87701396 256)))) (= |P1Thread1of1ForFork2_#t~ite15_Out-87701396| |P1Thread1of1ForFork2_#t~ite14_Out-87701396|)) (and (= ~y$w_buff0_used~0_In-87701396 |P1Thread1of1ForFork2_#t~ite15_Out-87701396|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-87701396| |P1Thread1of1ForFork2_#t~ite14_Out-87701396|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-87701396, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-87701396, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-87701396, ~weak$$choice2~0=~weak$$choice2~0_In-87701396, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-87701396|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-87701396} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-87701396, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-87701396, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-87701396, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-87701396|, ~weak$$choice2~0=~weak$$choice2~0_In-87701396, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-87701396|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-87701396} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 20:45:45,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff0_thd2~0_56) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:45:45,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L769-->L769-8: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-884642580 256))) (.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In-884642580 256))) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-884642580 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-884642580 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out-884642580| |P1Thread1of1ForFork2_#t~ite24_Out-884642580|)) (.cse1 (= (mod ~weak$$choice2~0_In-884642580 256) 0))) (or (let ((.cse4 (not .cse6))) (and (= 0 |P1Thread1of1ForFork2_#t~ite22_Out-884642580|) .cse0 .cse1 (not .cse2) (or (not .cse3) .cse4) (= |P1Thread1of1ForFork2_#t~ite23_Out-884642580| |P1Thread1of1ForFork2_#t~ite22_Out-884642580|) (or .cse4 (not .cse5)))) (and (or (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite24_Out-884642580| ~y$r_buff1_thd2~0_In-884642580) (= |P1Thread1of1ForFork2_#t~ite23_Out-884642580| |P1Thread1of1ForFork2_#t~ite23_In-884642580|)) (and (or .cse2 (and .cse5 .cse6) (and .cse6 .cse3)) (= |P1Thread1of1ForFork2_#t~ite23_Out-884642580| ~y$r_buff1_thd2~0_In-884642580) .cse0 .cse1)) (= |P1Thread1of1ForFork2_#t~ite22_In-884642580| |P1Thread1of1ForFork2_#t~ite22_Out-884642580|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-884642580, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-884642580, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-884642580, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_In-884642580|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-884642580|, ~weak$$choice2~0=~weak$$choice2~0_In-884642580, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-884642580} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-884642580, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-884642580, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-884642580, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_Out-884642580|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-884642580|, ~weak$$choice2~0=~weak$$choice2~0_In-884642580, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-884642580|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-884642580} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite22, P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 20:45:45,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In603514128 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In603514128 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In603514128 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In603514128 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out603514128|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In603514128 |P3Thread1of1ForFork0_#t~ite35_Out603514128|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In603514128, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In603514128, ~y$w_buff0_used~0=~y$w_buff0_used~0_In603514128, ~y$w_buff1_used~0=~y$w_buff1_used~0_In603514128} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In603514128, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In603514128, ~y$w_buff0_used~0=~y$w_buff0_used~0_In603514128, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out603514128|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In603514128} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 20:45:45,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:45:45,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-217273266 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-217273266 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out-217273266| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out-217273266| ~y$w_buff0_used~0_In-217273266)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-217273266, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-217273266} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-217273266, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-217273266, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-217273266|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 20:45:45,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-264998810 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-264998810 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-264998810 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-264998810 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-264998810|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-264998810 |P2Thread1of1ForFork3_#t~ite29_Out-264998810|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-264998810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-264998810, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-264998810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-264998810} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-264998810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-264998810, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-264998810, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-264998810|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-264998810} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 20:45:45,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1110952591 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1110952591 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1110952591 ~y$r_buff0_thd3~0_Out-1110952591)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out-1110952591 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110952591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1110952591} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1110952591|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110952591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1110952591} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 20:45:45,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-882846577 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-882846577 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-882846577 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-882846577 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-882846577|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-882846577 |P2Thread1of1ForFork3_#t~ite31_Out-882846577|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-882846577, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-882846577, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-882846577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882846577} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-882846577, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-882846577, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-882846577, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-882846577|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882846577} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 20:45:45,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L804-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_16)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 20:45:45,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-232602318 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-232602318 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite36_Out-232602318| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite36_Out-232602318| ~y$r_buff0_thd4~0_In-232602318) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-232602318, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-232602318} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-232602318, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-232602318, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-232602318|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 20:45:45,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In1350213856 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1350213856 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In1350213856 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1350213856 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite37_Out1350213856| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite37_Out1350213856| ~y$r_buff1_thd4~0_In1350213856)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1350213856, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1350213856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1350213856, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1350213856} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1350213856, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1350213856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1350213856, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1350213856|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1350213856} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 20:45:45,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L827-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:45:45,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:45:45,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite42_Out-726133103| |ULTIMATE.start_main_#t~ite43_Out-726133103|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-726133103 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-726133103 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-726133103| ~y$w_buff1~0_In-726133103) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite42_Out-726133103| ~y~0_In-726133103) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-726133103, ~y~0=~y~0_In-726133103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-726133103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-726133103} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-726133103, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-726133103|, ~y~0=~y~0_In-726133103, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-726133103|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-726133103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-726133103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:45:45,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1935342428 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1935342428 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1935342428| ~y$w_buff0_used~0_In-1935342428)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1935342428| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1935342428, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1935342428} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1935342428, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1935342428, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1935342428|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:45:45,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1747463303 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1747463303 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1747463303 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1747463303 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1747463303| ~y$w_buff1_used~0_In1747463303)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite45_Out1747463303| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1747463303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1747463303, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1747463303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1747463303} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1747463303, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1747463303, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1747463303, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1747463303|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1747463303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:45:45,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1025738865 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1025738865 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1025738865 |ULTIMATE.start_main_#t~ite46_Out-1025738865|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1025738865| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1025738865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1025738865} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1025738865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1025738865, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1025738865|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:45:45,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1018574144 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1018574144 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1018574144 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1018574144 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1018574144| ~y$r_buff1_thd0~0_In-1018574144) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite47_Out-1018574144|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1018574144, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1018574144, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1018574144, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1018574144} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1018574144, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1018574144, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1018574144|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1018574144, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1018574144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:45:45,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_11 2) (= 2 v_~__unbuffered_p1_EAX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 2 v_~__unbuffered_p3_EAX~0_8) (= 0 v_~__unbuffered_p3_EBX~0_8) (= |v_ULTIMATE.start_main_#t~ite47_13| v_~y$r_buff1_thd0~0_17) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:45:45,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:45:45 BasicIcfg [2019-12-18 20:45:45,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:45:45,108 INFO L168 Benchmark]: Toolchain (without parser) took 121789.26 ms. Allocated memory was 142.6 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 97.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 897.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:45,109 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:45:45,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.67 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 97.3 MB in the beginning and 153.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:45,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.60 ms. Allocated memory is still 200.8 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:45,110 INFO L168 Benchmark]: Boogie Preprocessor took 38.62 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:45,110 INFO L168 Benchmark]: RCFGBuilder took 898.90 ms. Allocated memory is still 200.8 MB. Free memory was 148.8 MB in the beginning and 99.6 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:45,111 INFO L168 Benchmark]: TraceAbstraction took 120037.74 ms. Allocated memory was 200.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 840.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:45:45,114 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.67 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 97.3 MB in the beginning and 153.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.60 ms. Allocated memory is still 200.8 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.62 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 898.90 ms. Allocated memory is still 200.8 MB. Free memory was 148.8 MB in the beginning and 99.6 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120037.74 ms. Allocated memory was 200.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 840.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 7815 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68763 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t613, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t614, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t615, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L852] FCALL, FORK 0 pthread_create(&t616, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L764] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L766] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.6s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4652 SDtfs, 6756 SDslu, 12650 SDs, 0 SdLazy, 7864 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 57 SyntacticMatches, 17 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166438occurred 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: 49.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 209350 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1121 NumberOfCodeBlocks, 1121 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1038 ConstructedInterpolants, 0 QuantifiedInterpolants, 166754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...