/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:45:05,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:45:05,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:45:05,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:45:05,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:45:05,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:45:05,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:45:05,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:45:05,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:45:05,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:45:05,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:45:05,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:45:05,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:45:05,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:45:05,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:45:05,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:45:05,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:45:05,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:45:05,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:45:05,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:45:05,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:45:05,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:45:05,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:45:05,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:45:05,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:45:05,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:45:05,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:45:05,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:45:05,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:45:05,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:45:05,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:45:05,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:45:05,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:45:05,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:45:05,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:45:05,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:45:05,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:45:05,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:45:05,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:45:05,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:45:05,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:45:05,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:45:05,106 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:45:05,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:45:05,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:45:05,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:45:05,107 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:45:05,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:45:05,108 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:45:05,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:45:05,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:45:05,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:45:05,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:45:05,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:45:05,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:45:05,109 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:45:05,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:45:05,109 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:45:05,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:45:05,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:45:05,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:45:05,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:45:05,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:45:05,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:45:05,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:45:05,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:45:05,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:45:05,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:45:05,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:45:05,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:45:05,112 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:45:05,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:45:05,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:45:05,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:45:05,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:45:05,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:45:05,424 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:45:05,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2019-12-18 13:45:05,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1778a2424/958d035238d9417ab541671ff49b0451/FLAG382727f5a [2019-12-18 13:45:06,066 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:45:06,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2019-12-18 13:45:06,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1778a2424/958d035238d9417ab541671ff49b0451/FLAG382727f5a [2019-12-18 13:45:06,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1778a2424/958d035238d9417ab541671ff49b0451 [2019-12-18 13:45:06,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:45:06,401 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:45:06,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:45:06,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:45:06,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:45:06,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:45:06" (1/1) ... [2019-12-18 13:45:06,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cae7156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:06, skipping insertion in model container [2019-12-18 13:45:06,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:45:06" (1/1) ... [2019-12-18 13:45:06,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:45:06,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:45:06,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:45:06,983 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:45:07,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:45:07,159 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:45:07,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07 WrapperNode [2019-12-18 13:45:07,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:45:07,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:45:07,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:45:07,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:45:07,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (1/1) ... [2019-12-18 13:45:07,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (1/1) ... [2019-12-18 13:45:07,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:45:07,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:45:07,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:45:07,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:45:07,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (1/1) ... [2019-12-18 13:45:07,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (1/1) ... [2019-12-18 13:45:07,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (1/1) ... [2019-12-18 13:45:07,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (1/1) ... [2019-12-18 13:45:07,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (1/1) ... [2019-12-18 13:45:07,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (1/1) ... [2019-12-18 13:45:07,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (1/1) ... [2019-12-18 13:45:07,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:45:07,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:45:07,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:45:07,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:45:07,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (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 13:45:07,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:45:07,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:45:07,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:45:07,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:45:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:45:07,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:45:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:45:07,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:45:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:45:07,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:45:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:45:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:45:07,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:45:07,355 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 13:45:08,166 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:45:08,166 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:45:08,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:45:08 BoogieIcfgContainer [2019-12-18 13:45:08,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:45:08,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:45:08,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:45:08,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:45:08,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:45:06" (1/3) ... [2019-12-18 13:45:08,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2730cf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:45:08, skipping insertion in model container [2019-12-18 13:45:08,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:45:07" (2/3) ... [2019-12-18 13:45:08,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2730cf4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:45:08, skipping insertion in model container [2019-12-18 13:45:08,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:45:08" (3/3) ... [2019-12-18 13:45:08,177 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_tso.oepc.i [2019-12-18 13:45:08,187 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:45:08,188 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:45:08,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:45:08,196 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:45:08,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,238 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,238 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,248 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,248 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,273 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,302 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,304 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:45:08,336 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:45:08,356 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:45:08,357 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:45:08,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:45:08,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:45:08,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:45:08,357 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:45:08,357 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:45:08,357 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:45:08,375 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 13:45:08,377 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 13:45:08,465 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 13:45:08,466 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:45:08,487 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:45:08,519 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 13:45:08,602 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 13:45:08,602 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:45:08,614 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:45:08,637 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:45:08,638 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:45:14,031 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 13:45:14,152 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 13:45:14,483 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-18 13:45:14,483 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 13:45:14,487 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 13:45:38,966 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 13:45:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 13:45:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:45:38,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:38,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:45:38,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-18 13:45:38,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:38,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954281788] [2019-12-18 13:45:38,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:39,262 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 13:45:39,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954281788] [2019-12-18 13:45:39,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:39,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:45:39,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139817232] [2019-12-18 13:45:39,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:45:39,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:39,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:45:39,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:39,287 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 13:45:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:40,399 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-18 13:45:40,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:45:40,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:45:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:44,488 INFO L225 Difference]: With dead ends: 125570 [2019-12-18 13:45:44,489 INFO L226 Difference]: Without dead ends: 111010 [2019-12-18 13:45:44,490 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 13:45:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-18 13:45:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-18 13:45:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-18 13:45:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-18 13:45:52,856 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-18 13:45:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:52,856 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-18 13:45:52,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:45:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-18 13:45:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:45:52,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:52,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:52,861 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-18 13:45:52,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:52,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621412097] [2019-12-18 13:45:52,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:53,001 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 13:45:53,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621412097] [2019-12-18 13:45:53,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:53,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:45:53,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875742807] [2019-12-18 13:45:53,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:45:53,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:53,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:45:53,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:45:53,005 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-18 13:45:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:58,729 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-18 13:45:58,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:45:58,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:45:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:59,265 INFO L225 Difference]: With dead ends: 172646 [2019-12-18 13:45:59,265 INFO L226 Difference]: Without dead ends: 172548 [2019-12-18 13:45:59,266 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 13:46:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-18 13:46:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-18 13:46:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-18 13:46:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-18 13:46:16,276 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-18 13:46:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:16,276 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-18 13:46:16,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:46:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-18 13:46:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:46:16,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:16,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:16,286 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:16,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:16,286 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-18 13:46:16,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:16,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943028202] [2019-12-18 13:46:16,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:16,369 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 13:46:16,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943028202] [2019-12-18 13:46:16,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:16,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:46:16,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39043982] [2019-12-18 13:46:16,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:46:16,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:16,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:46:16,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:46:16,371 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-18 13:46:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:16,513 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-18 13:46:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:46:16,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:46:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:16,571 INFO L225 Difference]: With dead ends: 34208 [2019-12-18 13:46:16,572 INFO L226 Difference]: Without dead ends: 34208 [2019-12-18 13:46:16,572 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 13:46:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-18 13:46:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-18 13:46:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-18 13:46:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-18 13:46:17,191 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-18 13:46:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:17,192 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-18 13:46:17,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:46:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-18 13:46:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:46:17,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:17,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:17,195 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-18 13:46:17,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:17,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740976060] [2019-12-18 13:46:17,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:17,241 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 13:46:17,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740976060] [2019-12-18 13:46:17,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:17,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:46:17,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090771081] [2019-12-18 13:46:17,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:46:17,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:17,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:46:17,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:46:17,244 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-18 13:46:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:17,435 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-18 13:46:17,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:46:17,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:46:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:17,523 INFO L225 Difference]: With dead ends: 51809 [2019-12-18 13:46:17,523 INFO L226 Difference]: Without dead ends: 51809 [2019-12-18 13:46:17,523 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 13:46:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-18 13:46:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-18 13:46:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-18 13:46:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-18 13:46:19,697 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-18 13:46:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:19,699 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-18 13:46:19,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:46:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-18 13:46:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:46:19,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:19,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:19,702 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:19,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:19,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-18 13:46:19,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:19,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897187890] [2019-12-18 13:46:19,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:19,811 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 13:46:19,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897187890] [2019-12-18 13:46:19,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:19,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:46:19,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853153002] [2019-12-18 13:46:19,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:46:19,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:46:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:46:19,813 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-18 13:46:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:20,370 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-18 13:46:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:46:20,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:46:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:20,463 INFO L225 Difference]: With dead ends: 53507 [2019-12-18 13:46:20,463 INFO L226 Difference]: Without dead ends: 53507 [2019-12-18 13:46:20,464 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 13:46:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-18 13:46:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-18 13:46:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-18 13:46:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-18 13:46:21,309 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-18 13:46:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:21,309 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-18 13:46:21,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:46:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-18 13:46:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:46:21,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:21,323 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] [2019-12-18 13:46:21,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-18 13:46:21,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:21,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55321291] [2019-12-18 13:46:21,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:21,421 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 13:46:21,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55321291] [2019-12-18 13:46:21,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:21,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:46:21,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140456062] [2019-12-18 13:46:21,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:46:21,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:21,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:46:21,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:46:21,424 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-18 13:46:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:23,223 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-18 13:46:23,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:46:23,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:46:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:23,379 INFO L225 Difference]: With dead ends: 66834 [2019-12-18 13:46:23,380 INFO L226 Difference]: Without dead ends: 66820 [2019-12-18 13:46:23,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:46:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-18 13:46:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-18 13:46:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-18 13:46:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-18 13:46:24,272 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-18 13:46:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:24,272 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-18 13:46:24,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:46:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-18 13:46:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:46:24,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:24,290 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] [2019-12-18 13:46:24,290 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-18 13:46:24,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:24,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572868940] [2019-12-18 13:46:24,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:24,348 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 13:46:24,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572868940] [2019-12-18 13:46:24,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:24,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:46:24,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650578028] [2019-12-18 13:46:24,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:46:24,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:24,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:46:24,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:46:24,350 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-18 13:46:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:24,432 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-18 13:46:24,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:46:24,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:46:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:24,458 INFO L225 Difference]: With dead ends: 18127 [2019-12-18 13:46:24,459 INFO L226 Difference]: Without dead ends: 18127 [2019-12-18 13:46:24,459 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 13:46:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-18 13:46:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-18 13:46:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-18 13:46:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-18 13:46:24,737 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-18 13:46:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:24,737 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-18 13:46:24,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:46:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-18 13:46:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:46:24,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:24,751 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:24,751 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-18 13:46:24,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:24,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110116556] [2019-12-18 13:46:24,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:24,843 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 13:46:24,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110116556] [2019-12-18 13:46:24,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:24,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:46:24,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740793130] [2019-12-18 13:46:24,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:46:24,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:24,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:46:24,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:46:24,846 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-18 13:46:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:25,419 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-18 13:46:25,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:46:25,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:46:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:25,456 INFO L225 Difference]: With dead ends: 25206 [2019-12-18 13:46:25,456 INFO L226 Difference]: Without dead ends: 25206 [2019-12-18 13:46:25,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:46:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-18 13:46:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-18 13:46:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-18 13:46:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-18 13:46:27,431 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-18 13:46:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:27,431 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-18 13:46:27,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:46:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-18 13:46:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:46:27,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:27,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:27,455 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-18 13:46:27,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:27,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680243740] [2019-12-18 13:46:27,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:27,540 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 13:46:27,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680243740] [2019-12-18 13:46:27,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:27,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:46:27,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140971917] [2019-12-18 13:46:27,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:46:27,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:46:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:46:27,543 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-18 13:46:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:28,722 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-18 13:46:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:46:28,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:46:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:28,762 INFO L225 Difference]: With dead ends: 28185 [2019-12-18 13:46:28,762 INFO L226 Difference]: Without dead ends: 28185 [2019-12-18 13:46:28,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:46:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-18 13:46:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-18 13:46:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-18 13:46:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-18 13:46:29,119 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-18 13:46:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:29,119 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-18 13:46:29,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:46:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-18 13:46:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:46:29,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:29,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:29,146 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:29,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:29,147 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-18 13:46:29,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:29,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884787556] [2019-12-18 13:46:29,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:29,229 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 13:46:29,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884787556] [2019-12-18 13:46:29,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:29,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:46:29,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829817055] [2019-12-18 13:46:29,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:46:29,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:29,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:46:29,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:46:29,231 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 3 states. [2019-12-18 13:46:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:29,318 INFO L93 Difference]: Finished difference Result 18532 states and 56133 transitions. [2019-12-18 13:46:29,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:46:29,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:46:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:29,353 INFO L225 Difference]: With dead ends: 18532 [2019-12-18 13:46:29,353 INFO L226 Difference]: Without dead ends: 18532 [2019-12-18 13:46:29,353 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 13:46:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18532 states. [2019-12-18 13:46:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18532 to 18524. [2019-12-18 13:46:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2019-12-18 13:46:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56117 transitions. [2019-12-18 13:46:29,761 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56117 transitions. Word has length 39 [2019-12-18 13:46:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:29,761 INFO L462 AbstractCegarLoop]: Abstraction has 18524 states and 56117 transitions. [2019-12-18 13:46:29,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:46:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56117 transitions. [2019-12-18 13:46:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:46:29,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:29,790 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] [2019-12-18 13:46:29,790 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:29,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1220902187, now seen corresponding path program 1 times [2019-12-18 13:46:29,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:29,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403124934] [2019-12-18 13:46:29,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:29,861 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 13:46:29,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403124934] [2019-12-18 13:46:29,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:29,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:46:29,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395005864] [2019-12-18 13:46:29,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:46:29,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:29,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:46:29,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:46:29,863 INFO L87 Difference]: Start difference. First operand 18524 states and 56117 transitions. Second operand 5 states. [2019-12-18 13:46:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:29,949 INFO L93 Difference]: Finished difference Result 17291 states and 53251 transitions. [2019-12-18 13:46:29,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:46:29,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:46:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:29,980 INFO L225 Difference]: With dead ends: 17291 [2019-12-18 13:46:29,980 INFO L226 Difference]: Without dead ends: 17291 [2019-12-18 13:46:29,982 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 13:46:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17291 states. [2019-12-18 13:46:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17291 to 16710. [2019-12-18 13:46:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-18 13:46:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 51682 transitions. [2019-12-18 13:46:30,246 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 51682 transitions. Word has length 40 [2019-12-18 13:46:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:30,246 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 51682 transitions. [2019-12-18 13:46:30,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:46:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 51682 transitions. [2019-12-18 13:46:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:46:30,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:30,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:30,494 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-18 13:46:30,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:30,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998578546] [2019-12-18 13:46:30,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:30,598 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 13:46:30,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998578546] [2019-12-18 13:46:30,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:30,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:46:30,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864307572] [2019-12-18 13:46:30,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:46:30,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:30,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:46:30,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:46:30,601 INFO L87 Difference]: Start difference. First operand 16710 states and 51682 transitions. Second operand 3 states. [2019-12-18 13:46:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:30,741 INFO L93 Difference]: Finished difference Result 20999 states and 64475 transitions. [2019-12-18 13:46:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:46:30,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:46:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:30,779 INFO L225 Difference]: With dead ends: 20999 [2019-12-18 13:46:30,780 INFO L226 Difference]: Without dead ends: 20999 [2019-12-18 13:46:30,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 13:46:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20999 states. [2019-12-18 13:46:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20999 to 17838. [2019-12-18 13:46:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17838 states. [2019-12-18 13:46:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17838 states to 17838 states and 55279 transitions. [2019-12-18 13:46:31,134 INFO L78 Accepts]: Start accepts. Automaton has 17838 states and 55279 transitions. Word has length 65 [2019-12-18 13:46:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:31,134 INFO L462 AbstractCegarLoop]: Abstraction has 17838 states and 55279 transitions. [2019-12-18 13:46:31,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:46:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 17838 states and 55279 transitions. [2019-12-18 13:46:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:31,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:31,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:31,154 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-18 13:46:31,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:31,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897323273] [2019-12-18 13:46:31,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:46:31,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897323273] [2019-12-18 13:46:31,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:31,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:46:31,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975933765] [2019-12-18 13:46:31,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:46:31,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:46:31,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:46:31,236 INFO L87 Difference]: Start difference. First operand 17838 states and 55279 transitions. Second operand 4 states. [2019-12-18 13:46:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:31,378 INFO L93 Difference]: Finished difference Result 21261 states and 65410 transitions. [2019-12-18 13:46:31,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:46:31,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 13:46:31,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:31,406 INFO L225 Difference]: With dead ends: 21261 [2019-12-18 13:46:31,406 INFO L226 Difference]: Without dead ends: 21261 [2019-12-18 13:46:31,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 13:46:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21261 states. [2019-12-18 13:46:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21261 to 17865. [2019-12-18 13:46:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17865 states. [2019-12-18 13:46:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17865 states to 17865 states and 55278 transitions. [2019-12-18 13:46:31,704 INFO L78 Accepts]: Start accepts. Automaton has 17865 states and 55278 transitions. Word has length 66 [2019-12-18 13:46:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:31,705 INFO L462 AbstractCegarLoop]: Abstraction has 17865 states and 55278 transitions. [2019-12-18 13:46:31,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:46:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17865 states and 55278 transitions. [2019-12-18 13:46:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:31,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:31,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:31,730 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-18 13:46:31,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:31,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517416712] [2019-12-18 13:46:31,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:31,911 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 13:46:31,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517416712] [2019-12-18 13:46:31,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:31,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:46:31,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224164703] [2019-12-18 13:46:31,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:46:31,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:46:31,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:46:31,913 INFO L87 Difference]: Start difference. First operand 17865 states and 55278 transitions. Second operand 10 states. [2019-12-18 13:46:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:34,079 INFO L93 Difference]: Finished difference Result 41608 states and 128455 transitions. [2019-12-18 13:46:34,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 13:46:34,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 13:46:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:34,120 INFO L225 Difference]: With dead ends: 41608 [2019-12-18 13:46:34,120 INFO L226 Difference]: Without dead ends: 28443 [2019-12-18 13:46:34,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:46:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28443 states. [2019-12-18 13:46:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28443 to 20934. [2019-12-18 13:46:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20934 states. [2019-12-18 13:46:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20934 states to 20934 states and 64596 transitions. [2019-12-18 13:46:34,696 INFO L78 Accepts]: Start accepts. Automaton has 20934 states and 64596 transitions. Word has length 66 [2019-12-18 13:46:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:34,697 INFO L462 AbstractCegarLoop]: Abstraction has 20934 states and 64596 transitions. [2019-12-18 13:46:34,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:46:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 20934 states and 64596 transitions. [2019-12-18 13:46:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:34,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:34,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:34,717 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:34,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:34,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-18 13:46:34,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:34,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833956313] [2019-12-18 13:46:34,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:34,937 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 13:46:34,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833956313] [2019-12-18 13:46:34,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:34,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:46:34,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172222836] [2019-12-18 13:46:34,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:46:34,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:34,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:46:34,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:46:34,940 INFO L87 Difference]: Start difference. First operand 20934 states and 64596 transitions. Second operand 10 states. [2019-12-18 13:46:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:36,753 INFO L93 Difference]: Finished difference Result 36359 states and 111312 transitions. [2019-12-18 13:46:36,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:46:36,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 13:46:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:36,811 INFO L225 Difference]: With dead ends: 36359 [2019-12-18 13:46:36,812 INFO L226 Difference]: Without dead ends: 30399 [2019-12-18 13:46:36,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:46:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30399 states. [2019-12-18 13:46:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30399 to 21386. [2019-12-18 13:46:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21386 states. [2019-12-18 13:46:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21386 states to 21386 states and 65844 transitions. [2019-12-18 13:46:37,205 INFO L78 Accepts]: Start accepts. Automaton has 21386 states and 65844 transitions. Word has length 66 [2019-12-18 13:46:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:37,206 INFO L462 AbstractCegarLoop]: Abstraction has 21386 states and 65844 transitions. [2019-12-18 13:46:37,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:46:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 21386 states and 65844 transitions. [2019-12-18 13:46:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:37,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:37,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:37,226 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-18 13:46:37,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:37,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802851999] [2019-12-18 13:46:37,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:37,393 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 13:46:37,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802851999] [2019-12-18 13:46:37,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:37,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:46:37,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309436851] [2019-12-18 13:46:37,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:46:37,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:37,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:46:37,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:46:37,395 INFO L87 Difference]: Start difference. First operand 21386 states and 65844 transitions. Second operand 11 states. [2019-12-18 13:46:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:39,277 INFO L93 Difference]: Finished difference Result 33042 states and 101402 transitions. [2019-12-18 13:46:39,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 13:46:39,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:46:39,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:39,318 INFO L225 Difference]: With dead ends: 33042 [2019-12-18 13:46:39,318 INFO L226 Difference]: Without dead ends: 29559 [2019-12-18 13:46:39,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:46:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29559 states. [2019-12-18 13:46:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29559 to 20954. [2019-12-18 13:46:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20954 states. [2019-12-18 13:46:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20954 states to 20954 states and 64512 transitions. [2019-12-18 13:46:39,909 INFO L78 Accepts]: Start accepts. Automaton has 20954 states and 64512 transitions. Word has length 66 [2019-12-18 13:46:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:39,909 INFO L462 AbstractCegarLoop]: Abstraction has 20954 states and 64512 transitions. [2019-12-18 13:46:39,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:46:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20954 states and 64512 transitions. [2019-12-18 13:46:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:39,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:39,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:39,932 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:39,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:39,932 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-18 13:46:39,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:39,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534268762] [2019-12-18 13:46:39,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:40,104 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 13:46:40,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534268762] [2019-12-18 13:46:40,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:40,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:46:40,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093905960] [2019-12-18 13:46:40,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:46:40,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:46:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:46:40,106 INFO L87 Difference]: Start difference. First operand 20954 states and 64512 transitions. Second operand 11 states. [2019-12-18 13:46:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:42,151 INFO L93 Difference]: Finished difference Result 34053 states and 104143 transitions. [2019-12-18 13:46:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 13:46:42,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:46:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:42,192 INFO L225 Difference]: With dead ends: 34053 [2019-12-18 13:46:42,192 INFO L226 Difference]: Without dead ends: 29681 [2019-12-18 13:46:42,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:46:42,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29681 states. [2019-12-18 13:46:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29681 to 21178. [2019-12-18 13:46:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21178 states. [2019-12-18 13:46:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21178 states to 21178 states and 65096 transitions. [2019-12-18 13:46:42,577 INFO L78 Accepts]: Start accepts. Automaton has 21178 states and 65096 transitions. Word has length 66 [2019-12-18 13:46:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:42,577 INFO L462 AbstractCegarLoop]: Abstraction has 21178 states and 65096 transitions. [2019-12-18 13:46:42,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:46:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 21178 states and 65096 transitions. [2019-12-18 13:46:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:42,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:42,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:42,601 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:42,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-18 13:46:42,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:42,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947526237] [2019-12-18 13:46:42,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:42,768 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 13:46:42,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947526237] [2019-12-18 13:46:42,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:42,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:46:42,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079192203] [2019-12-18 13:46:42,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:46:42,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:42,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:46:42,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:46:42,770 INFO L87 Difference]: Start difference. First operand 21178 states and 65096 transitions. Second operand 12 states. [2019-12-18 13:46:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:44,870 INFO L93 Difference]: Finished difference Result 31865 states and 97419 transitions. [2019-12-18 13:46:44,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:46:44,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 13:46:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:44,910 INFO L225 Difference]: With dead ends: 31865 [2019-12-18 13:46:44,910 INFO L226 Difference]: Without dead ends: 30127 [2019-12-18 13:46:44,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-18 13:46:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30127 states. [2019-12-18 13:46:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30127 to 21044. [2019-12-18 13:46:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21044 states. [2019-12-18 13:46:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21044 states to 21044 states and 64748 transitions. [2019-12-18 13:46:45,293 INFO L78 Accepts]: Start accepts. Automaton has 21044 states and 64748 transitions. Word has length 66 [2019-12-18 13:46:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:45,293 INFO L462 AbstractCegarLoop]: Abstraction has 21044 states and 64748 transitions. [2019-12-18 13:46:45,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:46:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 21044 states and 64748 transitions. [2019-12-18 13:46:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:45,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:45,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:45,317 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash -315236056, now seen corresponding path program 6 times [2019-12-18 13:46:45,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:45,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172198462] [2019-12-18 13:46:45,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:45,498 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 13:46:45,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172198462] [2019-12-18 13:46:45,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:45,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:46:45,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574021133] [2019-12-18 13:46:45,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:46:45,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:46:45,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:46:45,500 INFO L87 Difference]: Start difference. First operand 21044 states and 64748 transitions. Second operand 12 states. [2019-12-18 13:46:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:48,567 INFO L93 Difference]: Finished difference Result 38498 states and 117095 transitions. [2019-12-18 13:46:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 13:46:48,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 13:46:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:48,613 INFO L225 Difference]: With dead ends: 38498 [2019-12-18 13:46:48,614 INFO L226 Difference]: Without dead ends: 32776 [2019-12-18 13:46:48,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 13:46:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32776 states. [2019-12-18 13:46:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32776 to 20807. [2019-12-18 13:46:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20807 states. [2019-12-18 13:46:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20807 states to 20807 states and 63903 transitions. [2019-12-18 13:46:49,033 INFO L78 Accepts]: Start accepts. Automaton has 20807 states and 63903 transitions. Word has length 66 [2019-12-18 13:46:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:49,033 INFO L462 AbstractCegarLoop]: Abstraction has 20807 states and 63903 transitions. [2019-12-18 13:46:49,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:46:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 20807 states and 63903 transitions. [2019-12-18 13:46:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:49,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:49,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:49,054 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:49,055 INFO L82 PathProgramCache]: Analyzing trace with hash 99317356, now seen corresponding path program 7 times [2019-12-18 13:46:49,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:49,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248774370] [2019-12-18 13:46:49,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:49,221 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 13:46:49,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248774370] [2019-12-18 13:46:49,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:49,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:46:49,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402910663] [2019-12-18 13:46:49,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:46:49,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:49,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:46:49,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:46:49,223 INFO L87 Difference]: Start difference. First operand 20807 states and 63903 transitions. Second operand 11 states. [2019-12-18 13:46:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:52,351 INFO L93 Difference]: Finished difference Result 37204 states and 111003 transitions. [2019-12-18 13:46:52,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 13:46:52,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:46:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:52,402 INFO L225 Difference]: With dead ends: 37204 [2019-12-18 13:46:52,402 INFO L226 Difference]: Without dead ends: 36776 [2019-12-18 13:46:52,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 13:46:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36776 states. [2019-12-18 13:46:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36776 to 25297. [2019-12-18 13:46:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25297 states. [2019-12-18 13:46:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25297 states to 25297 states and 77269 transitions. [2019-12-18 13:46:52,875 INFO L78 Accepts]: Start accepts. Automaton has 25297 states and 77269 transitions. Word has length 66 [2019-12-18 13:46:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:52,875 INFO L462 AbstractCegarLoop]: Abstraction has 25297 states and 77269 transitions. [2019-12-18 13:46:52,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:46:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 25297 states and 77269 transitions. [2019-12-18 13:46:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:52,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:52,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:52,904 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:52,904 INFO L82 PathProgramCache]: Analyzing trace with hash -296830018, now seen corresponding path program 8 times [2019-12-18 13:46:52,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:52,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927258327] [2019-12-18 13:46:52,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:52,962 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 13:46:52,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927258327] [2019-12-18 13:46:52,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:52,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:46:52,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068120395] [2019-12-18 13:46:52,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:46:52,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:46:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:46:52,965 INFO L87 Difference]: Start difference. First operand 25297 states and 77269 transitions. Second operand 6 states. [2019-12-18 13:46:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:53,386 INFO L93 Difference]: Finished difference Result 67854 states and 204819 transitions. [2019-12-18 13:46:53,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:46:53,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 13:46:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:53,459 INFO L225 Difference]: With dead ends: 67854 [2019-12-18 13:46:53,459 INFO L226 Difference]: Without dead ends: 52054 [2019-12-18 13:46:53,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:46:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52054 states. [2019-12-18 13:46:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52054 to 26233. [2019-12-18 13:46:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26233 states. [2019-12-18 13:46:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26233 states to 26233 states and 80058 transitions. [2019-12-18 13:46:54,374 INFO L78 Accepts]: Start accepts. Automaton has 26233 states and 80058 transitions. Word has length 66 [2019-12-18 13:46:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:54,375 INFO L462 AbstractCegarLoop]: Abstraction has 26233 states and 80058 transitions. [2019-12-18 13:46:54,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:46:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 26233 states and 80058 transitions. [2019-12-18 13:46:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:54,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:54,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:54,402 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1527279588, now seen corresponding path program 9 times [2019-12-18 13:46:54,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:54,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130036133] [2019-12-18 13:46:54,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:46:54,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130036133] [2019-12-18 13:46:54,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:54,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 13:46:54,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110096057] [2019-12-18 13:46:54,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:46:54,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:46:54,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:46:54,630 INFO L87 Difference]: Start difference. First operand 26233 states and 80058 transitions. Second operand 13 states. [2019-12-18 13:46:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:58,556 INFO L93 Difference]: Finished difference Result 59403 states and 177656 transitions. [2019-12-18 13:46:58,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 13:46:58,556 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 13:46:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:58,641 INFO L225 Difference]: With dead ends: 59403 [2019-12-18 13:46:58,641 INFO L226 Difference]: Without dead ends: 59235 [2019-12-18 13:46:58,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=1799, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 13:46:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59235 states. [2019-12-18 13:46:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59235 to 35546. [2019-12-18 13:46:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35546 states. [2019-12-18 13:46:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35546 states to 35546 states and 108228 transitions. [2019-12-18 13:46:59,390 INFO L78 Accepts]: Start accepts. Automaton has 35546 states and 108228 transitions. Word has length 66 [2019-12-18 13:46:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:59,391 INFO L462 AbstractCegarLoop]: Abstraction has 35546 states and 108228 transitions. [2019-12-18 13:46:59,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:46:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 35546 states and 108228 transitions. [2019-12-18 13:46:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:59,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:59,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:59,428 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash 983480798, now seen corresponding path program 10 times [2019-12-18 13:46:59,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:59,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188844595] [2019-12-18 13:46:59,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:59,491 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 13:46:59,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188844595] [2019-12-18 13:46:59,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:59,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:46:59,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115883357] [2019-12-18 13:46:59,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:46:59,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:59,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:46:59,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:46:59,495 INFO L87 Difference]: Start difference. First operand 35546 states and 108228 transitions. Second operand 3 states. [2019-12-18 13:46:59,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:59,636 INFO L93 Difference]: Finished difference Result 35546 states and 108227 transitions. [2019-12-18 13:46:59,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:46:59,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:46:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:59,959 INFO L225 Difference]: With dead ends: 35546 [2019-12-18 13:46:59,959 INFO L226 Difference]: Without dead ends: 35546 [2019-12-18 13:46:59,960 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 13:47:00,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35546 states. [2019-12-18 13:47:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35546 to 29453. [2019-12-18 13:47:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29453 states. [2019-12-18 13:47:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29453 states to 29453 states and 90876 transitions. [2019-12-18 13:47:00,420 INFO L78 Accepts]: Start accepts. Automaton has 29453 states and 90876 transitions. Word has length 66 [2019-12-18 13:47:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:00,420 INFO L462 AbstractCegarLoop]: Abstraction has 29453 states and 90876 transitions. [2019-12-18 13:47:00,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:47:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 29453 states and 90876 transitions. [2019-12-18 13:47:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:00,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:00,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:47:00,451 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:00,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:00,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 1 times [2019-12-18 13:47:00,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:00,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416146943] [2019-12-18 13:47:00,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:47:00,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416146943] [2019-12-18 13:47:00,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:00,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:47:00,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466855785] [2019-12-18 13:47:00,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:47:00,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:00,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:47:00,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:47:00,638 INFO L87 Difference]: Start difference. First operand 29453 states and 90876 transitions. Second operand 11 states. [2019-12-18 13:47:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:02,770 INFO L93 Difference]: Finished difference Result 43732 states and 133895 transitions. [2019-12-18 13:47:02,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 13:47:02,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:47:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:02,831 INFO L225 Difference]: With dead ends: 43732 [2019-12-18 13:47:02,831 INFO L226 Difference]: Without dead ends: 42805 [2019-12-18 13:47:02,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:47:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42805 states. [2019-12-18 13:47:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42805 to 29357. [2019-12-18 13:47:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29357 states. [2019-12-18 13:47:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29357 states to 29357 states and 90616 transitions. [2019-12-18 13:47:03,388 INFO L78 Accepts]: Start accepts. Automaton has 29357 states and 90616 transitions. Word has length 67 [2019-12-18 13:47:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:03,388 INFO L462 AbstractCegarLoop]: Abstraction has 29357 states and 90616 transitions. [2019-12-18 13:47:03,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:47:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 29357 states and 90616 transitions. [2019-12-18 13:47:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:03,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:03,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:47:03,419 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 2 times [2019-12-18 13:47:03,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:03,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259783329] [2019-12-18 13:47:03,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:47:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:47:03,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:47:03,533 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:47:03,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= (select .cse0 |v_ULTIMATE.start_main_~#t1315~0.base_23|) 0) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1315~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1315~0.base_23|) |v_ULTIMATE.start_main_~#t1315~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1315~0.base_23| 4)) (= v_~main$tmp_guard1~0_48 0) (= |v_ULTIMATE.start_main_~#t1315~0.offset_17| 0) (= 0 v_~z$r_buff0_thd3~0_416) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1315~0.base_23|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1315~0.base_23| 1)) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1317~0.base=|v_ULTIMATE.start_main_~#t1317~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1317~0.offset=|v_ULTIMATE.start_main_~#t1317~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ULTIMATE.start_main_~#t1315~0.offset=|v_ULTIMATE.start_main_~#t1315~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1316~0.offset=|v_ULTIMATE.start_main_~#t1316~0.offset_12|, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1316~0.base=|v_ULTIMATE.start_main_~#t1316~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1315~0.base=|v_ULTIMATE.start_main_~#t1315~0.base_23|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1317~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1317~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1315~0.offset, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1316~0.offset, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1316~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1315~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:47:03,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1316~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1316~0.base_11|) |v_ULTIMATE.start_main_~#t1316~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1316~0.base_11| 4) |v_#length_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1316~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1316~0.offset_9|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1316~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1316~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1316~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1316~0.base=|v_ULTIMATE.start_main_~#t1316~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1316~0.offset=|v_ULTIMATE.start_main_~#t1316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1316~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1316~0.offset] because there is no mapped edge [2019-12-18 13:47:03,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:47:03,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1716868186 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1716868186 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1716868186| ~z~0_In1716868186) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1716868186| ~z$w_buff1~0_In1716868186) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1716868186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1716868186, ~z$w_buff1~0=~z$w_buff1~0_In1716868186, ~z~0=~z~0_In1716868186} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1716868186|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1716868186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1716868186, ~z$w_buff1~0=~z$w_buff1~0_In1716868186, ~z~0=~z~0_In1716868186} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 13:47:03,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 13:47:03,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1317~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1317~0.base_13|) |v_ULTIMATE.start_main_~#t1317~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1317~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1317~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1317~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1317~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1317~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1317~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1317~0.base=|v_ULTIMATE.start_main_~#t1317~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1317~0.offset=|v_ULTIMATE.start_main_~#t1317~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1317~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1317~0.offset] because there is no mapped edge [2019-12-18 13:47:03,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1576104056 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1576104056 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1576104056| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1576104056| ~z$w_buff0_used~0_In-1576104056) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1576104056, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1576104056} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1576104056, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1576104056|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1576104056} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:47:03,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-904756859 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-904756859 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-904756859 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-904756859 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-904756859 |P1Thread1of1ForFork2_#t~ite12_Out-904756859|)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-904756859| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-904756859, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-904756859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-904756859, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-904756859} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-904756859, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-904756859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-904756859, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-904756859|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-904756859} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:47:03,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1644603669 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1644603669 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1644603669| ~z$r_buff0_thd2~0_In-1644603669) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1644603669| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1644603669, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1644603669} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1644603669, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1644603669|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1644603669} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:47:03,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In473279205 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out473279205| ~z$w_buff0_used~0_In473279205) (= |P2Thread1of1ForFork0_#t~ite26_In473279205| |P2Thread1of1ForFork0_#t~ite26_Out473279205|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In473279205 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In473279205 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In473279205 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In473279205 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite26_Out473279205| ~z$w_buff0_used~0_In473279205) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out473279205| |P2Thread1of1ForFork0_#t~ite26_Out473279205|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In473279205|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In473279205, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In473279205, ~z$w_buff1_used~0=~z$w_buff1_used~0_In473279205, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In473279205, ~weak$$choice2~0=~weak$$choice2~0_In473279205} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out473279205|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out473279205|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In473279205, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In473279205, ~z$w_buff1_used~0=~z$w_buff1_used~0_In473279205, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In473279205, ~weak$$choice2~0=~weak$$choice2~0_In473279205} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 13:47:03,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:47:03,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-839307166 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-839307166 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-839307166|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-839307166 |P0Thread1of1ForFork1_#t~ite5_Out-839307166|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-839307166, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-839307166} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-839307166|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-839307166, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-839307166} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:47:03,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:47:03,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-2142175461| |P2Thread1of1ForFork0_#t~ite38_Out-2142175461|)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-2142175461 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2142175461 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-2142175461| ~z~0_In-2142175461) .cse2) (and .cse2 (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-2142175461| ~z$w_buff1~0_In-2142175461) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2142175461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2142175461, ~z$w_buff1~0=~z$w_buff1~0_In-2142175461, ~z~0=~z~0_In-2142175461} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-2142175461|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-2142175461|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2142175461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2142175461, ~z$w_buff1~0=~z$w_buff1~0_In-2142175461, ~z~0=~z~0_In-2142175461} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:47:03,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In13400650 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In13400650 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In13400650 |P2Thread1of1ForFork0_#t~ite40_Out13400650|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out13400650|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In13400650, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In13400650} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In13400650, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out13400650|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In13400650} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:47:03,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-828267191 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-828267191 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-828267191 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-828267191 256) 0))) (or (and (= ~z$w_buff1_used~0_In-828267191 |P2Thread1of1ForFork0_#t~ite41_Out-828267191|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-828267191|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-828267191, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-828267191, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-828267191, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-828267191} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-828267191, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-828267191, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-828267191, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-828267191, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-828267191|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:47:03,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1899877953 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1899877953 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1899877953| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1899877953| ~z$r_buff0_thd3~0_In-1899877953)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1899877953, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1899877953} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1899877953, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1899877953, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1899877953|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:47:03,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-361582378 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-361582378 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-361582378 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-361582378 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-361582378|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-361582378 |P2Thread1of1ForFork0_#t~ite43_Out-361582378|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-361582378, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-361582378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-361582378, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-361582378} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-361582378|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-361582378, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-361582378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-361582378, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-361582378} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:47:03,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:47:03,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-912964712 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-912964712 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-912964712 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-912964712 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-912964712| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-912964712 |P0Thread1of1ForFork1_#t~ite6_Out-912964712|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-912964712, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-912964712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-912964712, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-912964712} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-912964712, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-912964712|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-912964712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-912964712, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-912964712} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:47:03,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1930993194 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1930993194 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out1930993194 ~z$r_buff0_thd1~0_In1930993194) (or .cse0 .cse1)) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out1930993194 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1930993194, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1930993194} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1930993194, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1930993194|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1930993194} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:47:03,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In358840411 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In358840411 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In358840411 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In358840411 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out358840411| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out358840411| ~z$r_buff1_thd1~0_In358840411) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In358840411, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In358840411, ~z$w_buff1_used~0=~z$w_buff1_used~0_In358840411, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In358840411} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out358840411|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In358840411, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In358840411, ~z$w_buff1_used~0=~z$w_buff1_used~0_In358840411, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In358840411} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:47:03,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:47:03,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2115281005 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-2115281005 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-2115281005 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-2115281005 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-2115281005| ~z$r_buff1_thd2~0_In-2115281005) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out-2115281005| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115281005, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2115281005, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2115281005, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2115281005} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115281005, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2115281005, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2115281005, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2115281005|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2115281005} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:47:03,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:47:03,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:47:03,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1622657658 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1622657658 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite47_Out1622657658| |ULTIMATE.start_main_#t~ite48_Out1622657658|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1622657658| ~z$w_buff1~0_In1622657658) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out1622657658| ~z~0_In1622657658) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1622657658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1622657658, ~z$w_buff1~0=~z$w_buff1~0_In1622657658, ~z~0=~z~0_In1622657658} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1622657658, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1622657658|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1622657658, ~z$w_buff1~0=~z$w_buff1~0_In1622657658, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1622657658|, ~z~0=~z~0_In1622657658} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:47:03,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1291102526 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1291102526 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1291102526| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1291102526| ~z$w_buff0_used~0_In1291102526)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1291102526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1291102526} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1291102526, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1291102526, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1291102526|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:47:03,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-622394070 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-622394070 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-622394070 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-622394070 256) 0))) (or (and (= ~z$w_buff1_used~0_In-622394070 |ULTIMATE.start_main_#t~ite50_Out-622394070|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-622394070|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-622394070, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-622394070, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-622394070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-622394070} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-622394070|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-622394070, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-622394070, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-622394070, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-622394070} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:47:03,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1786091236 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1786091236 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1786091236|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1786091236 |ULTIMATE.start_main_#t~ite51_Out1786091236|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1786091236, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1786091236} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1786091236, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1786091236|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1786091236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:47:03,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1473864984 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1473864984 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1473864984 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1473864984 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1473864984| ~z$r_buff1_thd0~0_In-1473864984) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1473864984| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1473864984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1473864984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1473864984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1473864984} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1473864984|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1473864984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1473864984, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1473864984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1473864984} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:47:03,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:47:03,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:47:03 BasicIcfg [2019-12-18 13:47:03,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:47:03,684 INFO L168 Benchmark]: Toolchain (without parser) took 117283.27 ms. Allocated memory was 137.9 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 13:47:03,685 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:47:03,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.09 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.9 MB in the beginning and 155.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:03,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.13 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:03,686 INFO L168 Benchmark]: Boogie Preprocessor took 39.37 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:03,690 INFO L168 Benchmark]: RCFGBuilder took 906.30 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 99.4 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:03,690 INFO L168 Benchmark]: TraceAbstraction took 115513.40 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 13:47:03,699 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.09 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.9 MB in the beginning and 155.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.13 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.37 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 906.30 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 99.4 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115513.40 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1317, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 115.1s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 40.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6478 SDtfs, 6978 SDslu, 27107 SDs, 0 SdLazy, 23840 SolverSat, 368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 51 SyntacticMatches, 11 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 213962 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1170 NumberOfCodeBlocks, 1170 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1079 ConstructedInterpolants, 0 QuantifiedInterpolants, 250834 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...