/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:08:20,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:08:20,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:08:20,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:08:20,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:08:20,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:08:20,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:08:20,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:08:20,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:08:20,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:08:20,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:08:20,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:08:20,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:08:20,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:08:20,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:08:20,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:08:20,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:08:20,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:08:20,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:08:20,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:08:20,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:08:20,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:08:20,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:08:20,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:08:20,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:08:20,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:08:20,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:08:20,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:08:20,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:08:20,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:08:20,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:08:20,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:08:20,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:08:20,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:08:20,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:08:20,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:08:20,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:08:20,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:08:20,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:08:20,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:08:20,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:08:20,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 08:08:20,112 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:08:20,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:08:20,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:08:20,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:08:20,114 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:08:20,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:08:20,114 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:08:20,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:08:20,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:08:20,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:08:20,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:08:20,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:08:20,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:08:20,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:08:20,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:08:20,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:08:20,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:08:20,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:08:20,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:08:20,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:08:20,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:08:20,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:08:20,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:08:20,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:08:20,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:08:20,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:08:20,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:08:20,118 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:08:20,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:08:20,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:08:20,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:08:20,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:08:20,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:08:20,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:08:20,428 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:08:20,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-27 08:08:20,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c39bff287/50123df5464c4233b9a2bce7e3fe86d2/FLAG6a1beeb22 [2019-12-27 08:08:21,078 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:08:21,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-27 08:08:21,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c39bff287/50123df5464c4233b9a2bce7e3fe86d2/FLAG6a1beeb22 [2019-12-27 08:08:21,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c39bff287/50123df5464c4233b9a2bce7e3fe86d2 [2019-12-27 08:08:21,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:08:21,366 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:08:21,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:08:21,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:08:21,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:08:21,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:08:21" (1/1) ... [2019-12-27 08:08:21,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c02b278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:21, skipping insertion in model container [2019-12-27 08:08:21,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:08:21" (1/1) ... [2019-12-27 08:08:21,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:08:21,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:08:22,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:08:22,060 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:08:22,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:08:22,217 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:08:22,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22 WrapperNode [2019-12-27 08:08:22,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:08:22,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:08:22,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:08:22,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:08:22,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:08:22,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:08:22,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:08:22,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:08:22,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... [2019-12-27 08:08:22,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:08:22,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:08:22,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:08:22,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:08:22,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:08:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:08:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:08:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:08:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:08:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:08:22,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:08:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:08:22,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:08:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 08:08:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 08:08:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:08:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:08:22,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:08:22,406 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:08:23,113 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:08:23,114 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:08:23,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:08:23 BoogieIcfgContainer [2019-12-27 08:08:23,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:08:23,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:08:23,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:08:23,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:08:23,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:08:21" (1/3) ... [2019-12-27 08:08:23,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46049f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:08:23, skipping insertion in model container [2019-12-27 08:08:23,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:22" (2/3) ... [2019-12-27 08:08:23,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46049f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:08:23, skipping insertion in model container [2019-12-27 08:08:23,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:08:23" (3/3) ... [2019-12-27 08:08:23,127 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2019-12-27 08:08:23,138 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:08:23,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:08:23,154 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:08:23,155 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:08:23,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,190 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,192 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,193 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,202 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,202 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,202 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,203 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,203 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,214 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,216 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,216 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,237 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,237 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:23,253 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 08:08:23,270 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:08:23,270 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:08:23,270 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:08:23,270 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:08:23,270 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:08:23,270 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:08:23,271 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:08:23,271 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:08:23,288 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 08:08:23,290 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 08:08:23,401 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 08:08:23,401 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:08:23,421 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 08:08:23,441 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 08:08:23,527 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 08:08:23,528 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:08:23,536 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 08:08:23,551 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 08:08:23,552 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:08:26,830 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 08:08:26,945 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 08:08:26,966 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50143 [2019-12-27 08:08:26,967 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 08:08:26,970 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 93 transitions [2019-12-27 08:08:27,974 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16438 states. [2019-12-27 08:08:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 16438 states. [2019-12-27 08:08:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 08:08:27,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:27,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:27,983 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:27,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1237806690, now seen corresponding path program 1 times [2019-12-27 08:08:28,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:28,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045402172] [2019-12-27 08:08:28,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:28,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045402172] [2019-12-27 08:08:28,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:28,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:08:28,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769577359] [2019-12-27 08:08:28,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:28,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:28,242 INFO L87 Difference]: Start difference. First operand 16438 states. Second operand 3 states. [2019-12-27 08:08:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:28,607 INFO L93 Difference]: Finished difference Result 16294 states and 61568 transitions. [2019-12-27 08:08:28,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:28,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 08:08:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:28,758 INFO L225 Difference]: With dead ends: 16294 [2019-12-27 08:08:28,758 INFO L226 Difference]: Without dead ends: 15956 [2019-12-27 08:08:28,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15956 states. [2019-12-27 08:08:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15956 to 15956. [2019-12-27 08:08:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15956 states. [2019-12-27 08:08:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15956 states to 15956 states and 60359 transitions. [2019-12-27 08:08:29,582 INFO L78 Accepts]: Start accepts. Automaton has 15956 states and 60359 transitions. Word has length 7 [2019-12-27 08:08:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:29,583 INFO L462 AbstractCegarLoop]: Abstraction has 15956 states and 60359 transitions. [2019-12-27 08:08:29,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 15956 states and 60359 transitions. [2019-12-27 08:08:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:08:29,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:29,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:29,595 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1710281022, now seen corresponding path program 1 times [2019-12-27 08:08:29,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:29,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517032442] [2019-12-27 08:08:29,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:29,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517032442] [2019-12-27 08:08:29,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:29,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:29,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057243606] [2019-12-27 08:08:29,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:08:29,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:08:29,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:08:29,748 INFO L87 Difference]: Start difference. First operand 15956 states and 60359 transitions. Second operand 4 states. [2019-12-27 08:08:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:30,888 INFO L93 Difference]: Finished difference Result 25372 states and 91919 transitions. [2019-12-27 08:08:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:08:30,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 08:08:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:31,002 INFO L225 Difference]: With dead ends: 25372 [2019-12-27 08:08:31,003 INFO L226 Difference]: Without dead ends: 25358 [2019-12-27 08:08:31,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:08:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25358 states. [2019-12-27 08:08:31,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25358 to 22934. [2019-12-27 08:08:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22934 states. [2019-12-27 08:08:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22934 states to 22934 states and 84256 transitions. [2019-12-27 08:08:31,876 INFO L78 Accepts]: Start accepts. Automaton has 22934 states and 84256 transitions. Word has length 13 [2019-12-27 08:08:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:31,877 INFO L462 AbstractCegarLoop]: Abstraction has 22934 states and 84256 transitions. [2019-12-27 08:08:31,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:08:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22934 states and 84256 transitions. [2019-12-27 08:08:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:08:31,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:31,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:31,880 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 294680669, now seen corresponding path program 1 times [2019-12-27 08:08:31,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:31,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140904515] [2019-12-27 08:08:31,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:31,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-27 08:08:31,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140904515] [2019-12-27 08:08:31,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:31,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:31,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043304505] [2019-12-27 08:08:31,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:31,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:31,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:31,939 INFO L87 Difference]: Start difference. First operand 22934 states and 84256 transitions. Second operand 3 states. [2019-12-27 08:08:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:32,190 INFO L93 Difference]: Finished difference Result 13067 states and 41594 transitions. [2019-12-27 08:08:32,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:32,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 08:08:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:32,238 INFO L225 Difference]: With dead ends: 13067 [2019-12-27 08:08:32,238 INFO L226 Difference]: Without dead ends: 13067 [2019-12-27 08:08:32,238 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-27 08:08:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13067 states. [2019-12-27 08:08:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13067 to 13067. [2019-12-27 08:08:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13067 states. [2019-12-27 08:08:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13067 states to 13067 states and 41594 transitions. [2019-12-27 08:08:32,568 INFO L78 Accepts]: Start accepts. Automaton has 13067 states and 41594 transitions. Word has length 13 [2019-12-27 08:08:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:32,569 INFO L462 AbstractCegarLoop]: Abstraction has 13067 states and 41594 transitions. [2019-12-27 08:08:32,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13067 states and 41594 transitions. [2019-12-27 08:08:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:08:32,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:32,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:32,571 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:32,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:32,572 INFO L82 PathProgramCache]: Analyzing trace with hash 217378403, now seen corresponding path program 1 times [2019-12-27 08:08:32,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:32,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288481002] [2019-12-27 08:08:32,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:32,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288481002] [2019-12-27 08:08:32,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:32,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:08:32,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470618854] [2019-12-27 08:08:32,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:08:32,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:32,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:08:32,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:08:32,633 INFO L87 Difference]: Start difference. First operand 13067 states and 41594 transitions. Second operand 4 states. [2019-12-27 08:08:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:32,658 INFO L93 Difference]: Finished difference Result 1935 states and 4552 transitions. [2019-12-27 08:08:32,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:08:32,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 08:08:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:32,662 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 08:08:32,663 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 08:08:32,663 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-27 08:08:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 08:08:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 08:08:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 08:08:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4552 transitions. [2019-12-27 08:08:32,696 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4552 transitions. Word has length 14 [2019-12-27 08:08:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:32,696 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4552 transitions. [2019-12-27 08:08:32,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:08:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4552 transitions. [2019-12-27 08:08:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 08:08:32,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:32,699 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] [2019-12-27 08:08:32,699 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1829602713, now seen corresponding path program 1 times [2019-12-27 08:08:32,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:32,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319609206] [2019-12-27 08:08:32,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:32,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319609206] [2019-12-27 08:08:32,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:32,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:08:32,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953396443] [2019-12-27 08:08:32,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:08:32,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:32,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:08:32,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:08:32,829 INFO L87 Difference]: Start difference. First operand 1935 states and 4552 transitions. Second operand 5 states. [2019-12-27 08:08:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:32,860 INFO L93 Difference]: Finished difference Result 629 states and 1474 transitions. [2019-12-27 08:08:32,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:08:32,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 08:08:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:32,862 INFO L225 Difference]: With dead ends: 629 [2019-12-27 08:08:32,862 INFO L226 Difference]: Without dead ends: 629 [2019-12-27 08:08:32,863 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-27 08:08:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-27 08:08:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 573. [2019-12-27 08:08:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-27 08:08:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1342 transitions. [2019-12-27 08:08:32,875 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1342 transitions. Word has length 26 [2019-12-27 08:08:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:32,876 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1342 transitions. [2019-12-27 08:08:32,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:08:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1342 transitions. [2019-12-27 08:08:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:08:32,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:32,881 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] [2019-12-27 08:08:32,881 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:32,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:32,881 INFO L82 PathProgramCache]: Analyzing trace with hash -572389292, now seen corresponding path program 1 times [2019-12-27 08:08:32,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:32,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310701603] [2019-12-27 08:08:32,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:33,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310701603] [2019-12-27 08:08:33,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:33,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:08:33,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018670967] [2019-12-27 08:08:33,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:33,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:33,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:33,026 INFO L87 Difference]: Start difference. First operand 573 states and 1342 transitions. Second operand 3 states. [2019-12-27 08:08:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:33,088 INFO L93 Difference]: Finished difference Result 583 states and 1352 transitions. [2019-12-27 08:08:33,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:33,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 08:08:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:33,091 INFO L225 Difference]: With dead ends: 583 [2019-12-27 08:08:33,092 INFO L226 Difference]: Without dead ends: 583 [2019-12-27 08:08:33,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-12-27 08:08:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 579. [2019-12-27 08:08:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-12-27 08:08:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1348 transitions. [2019-12-27 08:08:33,107 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1348 transitions. Word has length 55 [2019-12-27 08:08:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:33,107 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 1348 transitions. [2019-12-27 08:08:33,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1348 transitions. [2019-12-27 08:08:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:08:33,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:33,109 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] [2019-12-27 08:08:33,110 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:33,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:33,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1691317009, now seen corresponding path program 1 times [2019-12-27 08:08:33,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:33,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664372933] [2019-12-27 08:08:33,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:33,453 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 08:08:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:33,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664372933] [2019-12-27 08:08:33,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:33,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:08:33,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893043564] [2019-12-27 08:08:33,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:08:33,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:33,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:08:33,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:08:33,483 INFO L87 Difference]: Start difference. First operand 579 states and 1348 transitions. Second operand 6 states. [2019-12-27 08:08:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:33,819 INFO L93 Difference]: Finished difference Result 932 states and 2170 transitions. [2019-12-27 08:08:33,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:08:33,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 08:08:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:33,823 INFO L225 Difference]: With dead ends: 932 [2019-12-27 08:08:33,823 INFO L226 Difference]: Without dead ends: 932 [2019-12-27 08:08:33,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:08:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-12-27 08:08:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 737. [2019-12-27 08:08:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-27 08:08:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1731 transitions. [2019-12-27 08:08:33,839 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1731 transitions. Word has length 55 [2019-12-27 08:08:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:33,839 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1731 transitions. [2019-12-27 08:08:33,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:08:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1731 transitions. [2019-12-27 08:08:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:08:33,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:33,842 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] [2019-12-27 08:08:33,842 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1786469187, now seen corresponding path program 2 times [2019-12-27 08:08:33,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:33,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124407032] [2019-12-27 08:08:33,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:33,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124407032] [2019-12-27 08:08:33,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:33,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:08:33,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784850839] [2019-12-27 08:08:33,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:08:33,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:33,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:08:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:08:33,959 INFO L87 Difference]: Start difference. First operand 737 states and 1731 transitions. Second operand 6 states. [2019-12-27 08:08:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:34,282 INFO L93 Difference]: Finished difference Result 1271 states and 2960 transitions. [2019-12-27 08:08:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:08:34,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 08:08:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:34,284 INFO L225 Difference]: With dead ends: 1271 [2019-12-27 08:08:34,284 INFO L226 Difference]: Without dead ends: 1271 [2019-12-27 08:08:34,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:08:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-12-27 08:08:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 815. [2019-12-27 08:08:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-12-27 08:08:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1928 transitions. [2019-12-27 08:08:34,300 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1928 transitions. Word has length 55 [2019-12-27 08:08:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:34,300 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1928 transitions. [2019-12-27 08:08:34,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:08:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1928 transitions. [2019-12-27 08:08:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:08:34,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:34,303 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] [2019-12-27 08:08:34,303 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash -711503501, now seen corresponding path program 3 times [2019-12-27 08:08:34,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:34,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297134480] [2019-12-27 08:08:34,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:34,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297134480] [2019-12-27 08:08:34,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:34,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:08:34,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16161942] [2019-12-27 08:08:34,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:08:34,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:08:34,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:08:34,447 INFO L87 Difference]: Start difference. First operand 815 states and 1928 transitions. Second operand 7 states. [2019-12-27 08:08:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:34,574 INFO L93 Difference]: Finished difference Result 1428 states and 3224 transitions. [2019-12-27 08:08:34,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:08:34,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 08:08:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:34,576 INFO L225 Difference]: With dead ends: 1428 [2019-12-27 08:08:34,576 INFO L226 Difference]: Without dead ends: 565 [2019-12-27 08:08:34,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:08:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-12-27 08:08:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 458. [2019-12-27 08:08:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-12-27 08:08:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 855 transitions. [2019-12-27 08:08:34,584 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 855 transitions. Word has length 55 [2019-12-27 08:08:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:34,584 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 855 transitions. [2019-12-27 08:08:34,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:08:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 855 transitions. [2019-12-27 08:08:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:08:34,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:34,586 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] [2019-12-27 08:08:34,586 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:34,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1170430471, now seen corresponding path program 4 times [2019-12-27 08:08:34,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:34,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525976045] [2019-12-27 08:08:34,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:34,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525976045] [2019-12-27 08:08:34,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:34,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:08:34,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531910373] [2019-12-27 08:08:34,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:08:34,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:08:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:08:34,727 INFO L87 Difference]: Start difference. First operand 458 states and 855 transitions. Second operand 7 states. [2019-12-27 08:08:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:35,136 INFO L93 Difference]: Finished difference Result 708 states and 1298 transitions. [2019-12-27 08:08:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 08:08:35,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 08:08:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:35,138 INFO L225 Difference]: With dead ends: 708 [2019-12-27 08:08:35,138 INFO L226 Difference]: Without dead ends: 708 [2019-12-27 08:08:35,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:08:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-12-27 08:08:35,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 437. [2019-12-27 08:08:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-27 08:08:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 814 transitions. [2019-12-27 08:08:35,147 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 814 transitions. Word has length 55 [2019-12-27 08:08:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:35,150 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 814 transitions. [2019-12-27 08:08:35,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:08:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 814 transitions. [2019-12-27 08:08:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 08:08:35,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:35,152 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] [2019-12-27 08:08:35,152 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash 646837790, now seen corresponding path program 1 times [2019-12-27 08:08:35,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:35,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338061143] [2019-12-27 08:08:35,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:35,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338061143] [2019-12-27 08:08:35,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:35,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:35,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779529056] [2019-12-27 08:08:35,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:35,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:35,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:35,582 INFO L87 Difference]: Start difference. First operand 437 states and 814 transitions. Second operand 3 states. [2019-12-27 08:08:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:35,594 INFO L93 Difference]: Finished difference Result 419 states and 761 transitions. [2019-12-27 08:08:35,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:35,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 08:08:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:35,595 INFO L225 Difference]: With dead ends: 419 [2019-12-27 08:08:35,595 INFO L226 Difference]: Without dead ends: 419 [2019-12-27 08:08:35,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-27 08:08:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2019-12-27 08:08:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-27 08:08:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 761 transitions. [2019-12-27 08:08:35,602 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 761 transitions. Word has length 56 [2019-12-27 08:08:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:35,602 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 761 transitions. [2019-12-27 08:08:35,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 761 transitions. [2019-12-27 08:08:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 08:08:35,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:35,604 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] [2019-12-27 08:08:35,604 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1815043520, now seen corresponding path program 1 times [2019-12-27 08:08:35,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:35,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969658334] [2019-12-27 08:08:35,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:35,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969658334] [2019-12-27 08:08:35,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:35,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:35,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90887603] [2019-12-27 08:08:35,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:35,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:35,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:35,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:35,713 INFO L87 Difference]: Start difference. First operand 419 states and 761 transitions. Second operand 3 states. [2019-12-27 08:08:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:35,756 INFO L93 Difference]: Finished difference Result 419 states and 760 transitions. [2019-12-27 08:08:35,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:35,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 08:08:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:35,757 INFO L225 Difference]: With dead ends: 419 [2019-12-27 08:08:35,757 INFO L226 Difference]: Without dead ends: 419 [2019-12-27 08:08:35,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:35,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-27 08:08:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 278. [2019-12-27 08:08:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-27 08:08:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 502 transitions. [2019-12-27 08:08:35,763 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 502 transitions. Word has length 56 [2019-12-27 08:08:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:35,763 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 502 transitions. [2019-12-27 08:08:35,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 502 transitions. [2019-12-27 08:08:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 08:08:35,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:35,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:35,765 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:35,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1847274299, now seen corresponding path program 1 times [2019-12-27 08:08:35,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:35,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314267411] [2019-12-27 08:08:35,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:36,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314267411] [2019-12-27 08:08:36,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:36,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:08:36,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703136971] [2019-12-27 08:08:36,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:08:36,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:36,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:08:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:08:36,037 INFO L87 Difference]: Start difference. First operand 278 states and 502 transitions. Second operand 13 states. [2019-12-27 08:08:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:36,604 INFO L93 Difference]: Finished difference Result 484 states and 852 transitions. [2019-12-27 08:08:36,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:08:36,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 08:08:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:36,605 INFO L225 Difference]: With dead ends: 484 [2019-12-27 08:08:36,605 INFO L226 Difference]: Without dead ends: 452 [2019-12-27 08:08:36,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:08:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-27 08:08:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 378. [2019-12-27 08:08:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-27 08:08:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 673 transitions. [2019-12-27 08:08:36,613 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 673 transitions. Word has length 57 [2019-12-27 08:08:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:36,613 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 673 transitions. [2019-12-27 08:08:36,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:08:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 673 transitions. [2019-12-27 08:08:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 08:08:36,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:36,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:36,615 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:36,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:36,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1476167727, now seen corresponding path program 2 times [2019-12-27 08:08:36,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:36,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203290003] [2019-12-27 08:08:36,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:37,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203290003] [2019-12-27 08:08:37,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:37,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 08:08:37,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953670531] [2019-12-27 08:08:37,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 08:08:37,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:37,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 08:08:37,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 08:08:37,175 INFO L87 Difference]: Start difference. First operand 378 states and 673 transitions. Second operand 19 states. [2019-12-27 08:08:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:38,758 INFO L93 Difference]: Finished difference Result 947 states and 1652 transitions. [2019-12-27 08:08:38,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 08:08:38,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-27 08:08:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:38,760 INFO L225 Difference]: With dead ends: 947 [2019-12-27 08:08:38,760 INFO L226 Difference]: Without dead ends: 915 [2019-12-27 08:08:38,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 08:08:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-12-27 08:08:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 412. [2019-12-27 08:08:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-27 08:08:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 737 transitions. [2019-12-27 08:08:38,770 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 737 transitions. Word has length 57 [2019-12-27 08:08:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:38,770 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 737 transitions. [2019-12-27 08:08:38,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 08:08:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 737 transitions. [2019-12-27 08:08:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 08:08:38,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:38,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:38,772 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:38,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1248889277, now seen corresponding path program 3 times [2019-12-27 08:08:38,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:38,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887321878] [2019-12-27 08:08:38,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:08:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:08:38,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:08:38,874 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:08:38,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~y$w_buff1~0_28) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22| 1)) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd0~0_79 0) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~z~0_14 0) (= 0 v_~y$w_buff0~0_28) (= v_~y$r_buff0_thd1~0_9 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22|) 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2516~0.base_22|) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$r_buff1_thd2~0_19) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~__unbuffered_cnt~0_23) (= v_~y~0_27 0) (= 0 v_~y$r_buff1_thd0~0_50) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_4| 0) (= 0 |v_ULTIMATE.start_main_~#t2516~0.offset_17|) (= v_~y$w_buff0_used~0_107 0) (= v_~y$mem_tmp~0_10 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22|) |v_ULTIMATE.start_main_~#t2516~0.offset_17| 0)) |v_#memory_int_19|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2516~0.base_22| 4) |v_#length_21|) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_~#t2516~0.base=|v_ULTIMATE.start_main_~#t2516~0.base_22|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_15|, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t2516~0.offset=|v_ULTIMATE.start_main_~#t2516~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_107, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_9|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_11|, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_27, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_18|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_19|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_11|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2516~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2517~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2516~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t2518~0.base, ULTIMATE.start_main_~#t2517~0.base, ULTIMATE.start_main_~#t2518~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 08:08:38,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2517~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2517~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11|) |v_ULTIMATE.start_main_~#t2517~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2517~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2517~0.base_11| 0)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2517~0.offset, ULTIMATE.start_main_~#t2517~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 08:08:38,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L804-1-->L806: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2518~0.base_10| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10|) |v_ULTIMATE.start_main_~#t2518~0.offset_10| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2518~0.base_10|)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2518~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2518~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2518~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2518~0.base] because there is no mapped edge [2019-12-27 08:08:38,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_43 256) 0) (= 1 v_~y$w_buff0_used~0_73) (= 2 v_~y$w_buff0~0_16) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~y$w_buff1_used~0_43 v_~y$w_buff0_used~0_74) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_17, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 08:08:38,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_10 2) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~z~0=v_~z~0_10, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 08:08:38,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1888697326 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1888697326 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-1888697326|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1888697326 |P2Thread1of1ForFork0_#t~ite11_Out-1888697326|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1888697326, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1888697326} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1888697326, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1888697326|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1888697326} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 08:08:38,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite4_Out2092406542| |P1Thread1of1ForFork2_#t~ite3_Out2092406542|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In2092406542 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2092406542 256)))) (or (and (= ~y$w_buff1~0_In2092406542 |P1Thread1of1ForFork2_#t~ite3_Out2092406542|) .cse0 (not .cse1) (not .cse2)) (and (= ~y~0_In2092406542 |P1Thread1of1ForFork2_#t~ite3_Out2092406542|) .cse0 (or .cse1 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2092406542, ~y$w_buff1~0=~y$w_buff1~0_In2092406542, ~y~0=~y~0_In2092406542, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2092406542} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2092406542, ~y$w_buff1~0=~y$w_buff1~0_In2092406542, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out2092406542|, ~y~0=~y~0_In2092406542, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out2092406542|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2092406542} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 08:08:38,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1622214867 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1622214867 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-1622214867|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1622214867 |P1Thread1of1ForFork2_#t~ite5_Out-1622214867|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1622214867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1622214867} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1622214867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1622214867, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1622214867|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 08:08:38,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1941385021 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1941385021 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1941385021 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1941385021 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out1941385021| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite12_Out1941385021| ~y$w_buff1_used~0_In1941385021)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1941385021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1941385021, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1941385021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1941385021} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1941385021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1941385021, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1941385021|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1941385021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1941385021} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 08:08:38,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1902294284 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1902294284 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1902294284 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1902294284 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out1902294284|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1902294284 |P1Thread1of1ForFork2_#t~ite6_Out1902294284|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1902294284, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1902294284, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1902294284, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1902294284} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1902294284, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1902294284, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1902294284, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1902294284|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1902294284} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 08:08:38,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-574163224 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-574163224 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out-574163224| 0)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out-574163224| ~y$r_buff0_thd2~0_In-574163224) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-574163224, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-574163224} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-574163224, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-574163224, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-574163224|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 08:08:38,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1919837780 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1919837780 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1919837780 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1919837780 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite8_Out-1919837780| 0)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out-1919837780| ~y$r_buff1_thd2~0_In-1919837780) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1919837780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1919837780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1919837780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1919837780} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1919837780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1919837780, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1919837780|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1919837780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1919837780} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 08:08:38,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L754-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 08:08:38,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1632935703 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1632935703 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-1632935703 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1632935703 ~y$r_buff0_thd3~0_Out-1632935703)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1632935703, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1632935703} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1632935703, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1632935703, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1632935703|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 08:08:38,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1061096087 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1061096087 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1061096087 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1061096087 256)))) (or (and (= ~y$r_buff1_thd3~0_In-1061096087 |P2Thread1of1ForFork0_#t~ite14_Out-1061096087|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-1061096087|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1061096087, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1061096087, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1061096087, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1061096087} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1061096087|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1061096087, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1061096087, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1061096087, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1061096087} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 08:08:38,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 08:08:38,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 08:08:38,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-2623693 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-2623693| |ULTIMATE.start_main_#t~ite18_Out-2623693|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2623693 256)))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite18_Out-2623693| ~y~0_In-2623693)) (and (= |ULTIMATE.start_main_#t~ite18_Out-2623693| ~y$w_buff1~0_In-2623693) (not .cse0) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2623693, ~y~0=~y~0_In-2623693, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2623693, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2623693} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2623693, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-2623693|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2623693|, ~y~0=~y~0_In-2623693, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2623693, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2623693} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 08:08:38,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In42092359 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In42092359 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In42092359 |ULTIMATE.start_main_#t~ite20_Out42092359|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out42092359|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In42092359, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In42092359} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In42092359, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In42092359, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out42092359|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 08:08:38,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In570855508 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In570855508 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In570855508 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In570855508 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out570855508|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite21_Out570855508| ~y$w_buff1_used~0_In570855508) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In570855508, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In570855508, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In570855508, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570855508} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In570855508, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In570855508, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out570855508|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In570855508, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570855508} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 08:08:38,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1331883365 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1331883365 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1331883365| ~y$r_buff0_thd0~0_In1331883365)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1331883365| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1331883365, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1331883365} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1331883365, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1331883365, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1331883365|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 08:08:38,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1416888998 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1416888998 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1416888998 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1416888998 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out-1416888998| 0)) (and (= |ULTIMATE.start_main_#t~ite23_Out-1416888998| ~y$r_buff1_thd0~0_In-1416888998) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1416888998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1416888998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1416888998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1416888998} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1416888998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1416888998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1416888998, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1416888998|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1416888998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 08:08:38,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L827-->L827-8: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite38_Out-554895086| |ULTIMATE.start_main_#t~ite39_Out-554895086|)) (.cse4 (= (mod ~y$w_buff0_used~0_In-554895086 256) 0)) (.cse5 (= (mod ~y$r_buff1_thd0~0_In-554895086 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-554895086 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In-554895086 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-554895086 256)))) (or (let ((.cse2 (not .cse6))) (and .cse0 .cse1 (or .cse2 (not .cse3)) (= |ULTIMATE.start_main_#t~ite38_Out-554895086| |ULTIMATE.start_main_#t~ite37_Out-554895086|) (not .cse4) (= 0 |ULTIMATE.start_main_#t~ite37_Out-554895086|) (or (not .cse5) .cse2))) (and (or (and .cse0 .cse1 (= |ULTIMATE.start_main_#t~ite38_Out-554895086| ~y$w_buff1_used~0_In-554895086) (or .cse4 (and .cse5 .cse6) (and .cse3 .cse6))) (and (= |ULTIMATE.start_main_#t~ite38_Out-554895086| |ULTIMATE.start_main_#t~ite38_In-554895086|) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-554895086| ~y$w_buff1_used~0_In-554895086))) (= |ULTIMATE.start_main_#t~ite37_In-554895086| |ULTIMATE.start_main_#t~ite37_Out-554895086|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-554895086, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-554895086, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-554895086|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-554895086|, ~weak$$choice2~0=~weak$$choice2~0_In-554895086, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-554895086, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-554895086} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-554895086, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-554895086|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-554895086, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-554895086|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-554895086|, ~weak$$choice2~0=~weak$$choice2~0_In-554895086, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-554895086, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-554895086} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 08:08:38,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_63 v_~y$r_buff0_thd0~0_62)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 08:08:38,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L831-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= v_~y~0_22 v_~y$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:08:38,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 08:08:38,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:08:38 BasicIcfg [2019-12-27 08:08:38,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:08:38,979 INFO L168 Benchmark]: Toolchain (without parser) took 17613.53 ms. Allocated memory was 145.8 MB in the beginning and 741.3 MB in the end (delta: 595.6 MB). Free memory was 101.3 MB in the beginning and 596.8 MB in the end (delta: -495.5 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:38,980 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 08:08:38,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.41 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 155.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:38,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.42 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:38,982 INFO L168 Benchmark]: Boogie Preprocessor took 45.49 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:38,982 INFO L168 Benchmark]: RCFGBuilder took 777.16 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 103.8 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:38,983 INFO L168 Benchmark]: TraceAbstraction took 15860.10 ms. Allocated memory was 202.9 MB in the beginning and 741.3 MB in the end (delta: 538.4 MB). Free memory was 103.8 MB in the beginning and 596.8 MB in the end (delta: -493.0 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:38,986 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 850.41 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 155.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.42 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.49 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.16 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 103.8 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15860.10 ms. Allocated memory was 202.9 MB in the beginning and 741.3 MB in the end (delta: 538.4 MB). Free memory was 103.8 MB in the beginning and 596.8 MB in the end (delta: -493.0 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 25 ChoiceCompositions, 4072 VarBasedMoverChecksPositive, 154 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50143 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L779] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1432 SDtfs, 1524 SDslu, 3613 SDs, 0 SdLazy, 2888 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22934occurred 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: 2.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 4231 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 98276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...