/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:24:43,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:24:43,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:24:43,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:24:43,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:24:43,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:24:43,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:24:43,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:24:43,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:24:43,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:24:43,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:24:43,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:24:43,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:24:43,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:24:43,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:24:43,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:24:43,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:24:43,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:24:43,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:24:43,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:24:43,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:24:43,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:24:43,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:24:43,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:24:43,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:24:43,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:24:43,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:24:43,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:24:43,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:24:43,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:24:43,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:24:43,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:24:43,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:24:43,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:24:43,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:24:43,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:24:43,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:24:43,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:24:43,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:24:43,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:24:43,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:24:43,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:24:43,110 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:24:43,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:24:43,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:24:43,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:24:43,112 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:24:43,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:24:43,113 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:24:43,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:24:43,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:24:43,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:24:43,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:24:43,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:24:43,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:24:43,114 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:24:43,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:24:43,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:24:43,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:24:43,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:24:43,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:24:43,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:24:43,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:24:43,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:24:43,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:24:43,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:24:43,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:24:43,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:24:43,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:24:43,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:24:43,117 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:24:43,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:24:43,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:24:43,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:24:43,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:24:43,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:24:43,408 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:24:43,410 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-18 12:24:43,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4997d3276/a93adec3b920443fb2cff2f656b4a313/FLAGa1431d67f [2019-12-18 12:24:44,090 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:24:44,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-18 12:24:44,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4997d3276/a93adec3b920443fb2cff2f656b4a313/FLAGa1431d67f [2019-12-18 12:24:44,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4997d3276/a93adec3b920443fb2cff2f656b4a313 [2019-12-18 12:24:44,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:24:44,328 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:24:44,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:24:44,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:24:44,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:24:44,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:24:44" (1/1) ... [2019-12-18 12:24:44,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b8d5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:44, skipping insertion in model container [2019-12-18 12:24:44,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:24:44" (1/1) ... [2019-12-18 12:24:44,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:24:44,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:24:44,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:24:44,951 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:24:45,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:24:45,103 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:24:45,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45 WrapperNode [2019-12-18 12:24:45,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:24:45,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:24:45,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:24:45,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:24:45,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... [2019-12-18 12:24:45,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... [2019-12-18 12:24:45,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:24:45,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:24:45,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:24:45,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:24:45,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... [2019-12-18 12:24:45,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... [2019-12-18 12:24:45,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... [2019-12-18 12:24:45,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... [2019-12-18 12:24:45,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... [2019-12-18 12:24:45,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... [2019-12-18 12:24:45,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... [2019-12-18 12:24:45,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:24:45,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:24:45,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:24:45,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:24:45,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:24:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:24:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:24:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:24:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:24:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:24:45,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:24:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:24:45,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:24:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:24:45,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:24:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:24:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:24:45,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:24:45,285 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:24:46,066 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:24:46,066 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:24:46,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:24:46 BoogieIcfgContainer [2019-12-18 12:24:46,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:24:46,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:24:46,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:24:46,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:24:46,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:24:44" (1/3) ... [2019-12-18 12:24:46,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f906e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:24:46, skipping insertion in model container [2019-12-18 12:24:46,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:45" (2/3) ... [2019-12-18 12:24:46,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f906e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:24:46, skipping insertion in model container [2019-12-18 12:24:46,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:24:46" (3/3) ... [2019-12-18 12:24:46,077 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc.i [2019-12-18 12:24:46,087 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:24:46,087 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:24:46,095 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:24:46,096 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:24:46,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,148 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,148 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,149 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,149 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,157 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,157 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,166 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,166 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,229 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,231 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:46,265 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:24:46,287 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:24:46,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:24:46,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:24:46,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:24:46,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:24:46,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:24:46,288 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:24:46,288 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:24:46,314 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 12:24:46,316 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:24:46,413 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:24:46,414 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:24:46,437 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:24:46,465 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:24:46,517 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:24:46,517 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:24:46,527 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:24:46,549 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:24:46,550 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:24:51,911 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:24:52,037 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:24:52,342 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:24:52,470 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:24:52,499 INFO L206 etLargeBlockEncoding]: Checked pairs total: 90866 [2019-12-18 12:24:52,500 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 12:24:52,504 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-18 12:25:13,080 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123302 states. [2019-12-18 12:25:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 123302 states. [2019-12-18 12:25:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:25:13,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:13,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:25:13,089 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:13,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:13,095 INFO L82 PathProgramCache]: Analyzing trace with hash 918873, now seen corresponding path program 1 times [2019-12-18 12:25:13,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:13,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702226182] [2019-12-18 12:25:13,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:13,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702226182] [2019-12-18 12:25:13,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:13,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:25:13,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879094972] [2019-12-18 12:25:13,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:13,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:13,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:13,332 INFO L87 Difference]: Start difference. First operand 123302 states. Second operand 3 states. [2019-12-18 12:25:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:15,831 INFO L93 Difference]: Finished difference Result 122174 states and 518852 transitions. [2019-12-18 12:25:15,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:15,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:25:15,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:16,466 INFO L225 Difference]: With dead ends: 122174 [2019-12-18 12:25:16,467 INFO L226 Difference]: Without dead ends: 115076 [2019-12-18 12:25:16,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115076 states. [2019-12-18 12:25:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115076 to 115076. [2019-12-18 12:25:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115076 states. [2019-12-18 12:25:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115076 states to 115076 states and 488094 transitions. [2019-12-18 12:25:30,886 INFO L78 Accepts]: Start accepts. Automaton has 115076 states and 488094 transitions. Word has length 3 [2019-12-18 12:25:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:30,886 INFO L462 AbstractCegarLoop]: Abstraction has 115076 states and 488094 transitions. [2019-12-18 12:25:30,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 115076 states and 488094 transitions. [2019-12-18 12:25:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:25:30,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:30,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:30,892 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1360334080, now seen corresponding path program 1 times [2019-12-18 12:25:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:30,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939268921] [2019-12-18 12:25:30,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:30,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939268921] [2019-12-18 12:25:30,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:30,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:25:30,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069555295] [2019-12-18 12:25:30,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:25:30,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:25:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:30,998 INFO L87 Difference]: Start difference. First operand 115076 states and 488094 transitions. Second operand 4 states. [2019-12-18 12:25:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:36,748 INFO L93 Difference]: Finished difference Result 178684 states and 728513 transitions. [2019-12-18 12:25:36,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:25:36,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:25:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:37,382 INFO L225 Difference]: With dead ends: 178684 [2019-12-18 12:25:37,382 INFO L226 Difference]: Without dead ends: 178635 [2019-12-18 12:25:37,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:42,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178635 states. [2019-12-18 12:25:46,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178635 to 162755. [2019-12-18 12:25:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162755 states. [2019-12-18 12:25:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162755 states to 162755 states and 672033 transitions. [2019-12-18 12:25:52,763 INFO L78 Accepts]: Start accepts. Automaton has 162755 states and 672033 transitions. Word has length 11 [2019-12-18 12:25:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:52,763 INFO L462 AbstractCegarLoop]: Abstraction has 162755 states and 672033 transitions. [2019-12-18 12:25:52,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:25:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 162755 states and 672033 transitions. [2019-12-18 12:25:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:25:52,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:52,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:52,772 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1888852276, now seen corresponding path program 1 times [2019-12-18 12:25:52,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:52,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464016311] [2019-12-18 12:25:52,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:52,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464016311] [2019-12-18 12:25:52,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:52,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:25:52,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076144383] [2019-12-18 12:25:52,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:52,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:52,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:52,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:52,831 INFO L87 Difference]: Start difference. First operand 162755 states and 672033 transitions. Second operand 3 states. [2019-12-18 12:25:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:52,975 INFO L93 Difference]: Finished difference Result 34587 states and 111811 transitions. [2019-12-18 12:25:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:52,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:25:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:53,074 INFO L225 Difference]: With dead ends: 34587 [2019-12-18 12:25:53,074 INFO L226 Difference]: Without dead ends: 34587 [2019-12-18 12:25:53,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34587 states. [2019-12-18 12:25:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34587 to 34587. [2019-12-18 12:25:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34587 states. [2019-12-18 12:25:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34587 states to 34587 states and 111811 transitions. [2019-12-18 12:25:54,857 INFO L78 Accepts]: Start accepts. Automaton has 34587 states and 111811 transitions. Word has length 13 [2019-12-18 12:25:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:54,857 INFO L462 AbstractCegarLoop]: Abstraction has 34587 states and 111811 transitions. [2019-12-18 12:25:54,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 34587 states and 111811 transitions. [2019-12-18 12:25:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:25:54,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:54,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:54,861 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1220224201, now seen corresponding path program 1 times [2019-12-18 12:25:54,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:54,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099433153] [2019-12-18 12:25:54,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:54,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099433153] [2019-12-18 12:25:54,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:54,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:54,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852602377] [2019-12-18 12:25:54,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:25:54,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:25:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:54,961 INFO L87 Difference]: Start difference. First operand 34587 states and 111811 transitions. Second operand 5 states. [2019-12-18 12:25:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:55,518 INFO L93 Difference]: Finished difference Result 47506 states and 151809 transitions. [2019-12-18 12:25:55,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:25:55,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:25:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:55,614 INFO L225 Difference]: With dead ends: 47506 [2019-12-18 12:25:55,614 INFO L226 Difference]: Without dead ends: 47506 [2019-12-18 12:25:55,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47506 states. [2019-12-18 12:25:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47506 to 39981. [2019-12-18 12:25:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39981 states. [2019-12-18 12:25:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39981 states to 39981 states and 128832 transitions. [2019-12-18 12:25:56,377 INFO L78 Accepts]: Start accepts. Automaton has 39981 states and 128832 transitions. Word has length 16 [2019-12-18 12:25:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:56,378 INFO L462 AbstractCegarLoop]: Abstraction has 39981 states and 128832 transitions. [2019-12-18 12:25:56,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:25:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 39981 states and 128832 transitions. [2019-12-18 12:25:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:25:56,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:56,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:56,388 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1720601530, now seen corresponding path program 1 times [2019-12-18 12:25:56,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:56,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436428194] [2019-12-18 12:25:56,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:56,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436428194] [2019-12-18 12:25:56,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:56,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:25:56,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717692638] [2019-12-18 12:25:56,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:25:56,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:56,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:25:56,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:25:56,494 INFO L87 Difference]: Start difference. First operand 39981 states and 128832 transitions. Second operand 6 states. [2019-12-18 12:25:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:58,132 INFO L93 Difference]: Finished difference Result 59624 states and 187628 transitions. [2019-12-18 12:25:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:25:58,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:25:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:58,232 INFO L225 Difference]: With dead ends: 59624 [2019-12-18 12:25:58,232 INFO L226 Difference]: Without dead ends: 59617 [2019-12-18 12:25:58,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:25:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59617 states. [2019-12-18 12:25:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59617 to 40463. [2019-12-18 12:25:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40463 states. [2019-12-18 12:25:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40463 states to 40463 states and 129749 transitions. [2019-12-18 12:25:59,062 INFO L78 Accepts]: Start accepts. Automaton has 40463 states and 129749 transitions. Word has length 22 [2019-12-18 12:25:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:59,062 INFO L462 AbstractCegarLoop]: Abstraction has 40463 states and 129749 transitions. [2019-12-18 12:25:59,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:25:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 40463 states and 129749 transitions. [2019-12-18 12:25:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:25:59,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:59,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:59,076 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:59,077 INFO L82 PathProgramCache]: Analyzing trace with hash -74763598, now seen corresponding path program 1 times [2019-12-18 12:25:59,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:59,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722278583] [2019-12-18 12:25:59,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:59,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722278583] [2019-12-18 12:25:59,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:59,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:59,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480374913] [2019-12-18 12:25:59,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:25:59,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:59,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:25:59,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:59,147 INFO L87 Difference]: Start difference. First operand 40463 states and 129749 transitions. Second operand 4 states. [2019-12-18 12:25:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:59,216 INFO L93 Difference]: Finished difference Result 16096 states and 48753 transitions. [2019-12-18 12:25:59,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:25:59,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:25:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:59,238 INFO L225 Difference]: With dead ends: 16096 [2019-12-18 12:25:59,239 INFO L226 Difference]: Without dead ends: 16096 [2019-12-18 12:25:59,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2019-12-18 12:26:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 15803. [2019-12-18 12:26:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15803 states. [2019-12-18 12:26:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15803 states to 15803 states and 47917 transitions. [2019-12-18 12:26:00,104 INFO L78 Accepts]: Start accepts. Automaton has 15803 states and 47917 transitions. Word has length 25 [2019-12-18 12:26:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:00,104 INFO L462 AbstractCegarLoop]: Abstraction has 15803 states and 47917 transitions. [2019-12-18 12:26:00,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:26:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 15803 states and 47917 transitions. [2019-12-18 12:26:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:26:00,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:00,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:00,116 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:00,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:00,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1856606199, now seen corresponding path program 1 times [2019-12-18 12:26:00,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:00,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316606486] [2019-12-18 12:26:00,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:00,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316606486] [2019-12-18 12:26:00,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:00,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:26:00,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806674965] [2019-12-18 12:26:00,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:26:00,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:00,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:26:00,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:26:00,224 INFO L87 Difference]: Start difference. First operand 15803 states and 47917 transitions. Second operand 6 states. [2019-12-18 12:26:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:00,800 INFO L93 Difference]: Finished difference Result 22779 states and 67340 transitions. [2019-12-18 12:26:00,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:26:00,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:26:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:00,832 INFO L225 Difference]: With dead ends: 22779 [2019-12-18 12:26:00,832 INFO L226 Difference]: Without dead ends: 22779 [2019-12-18 12:26:00,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:26:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-12-18 12:26:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 18120. [2019-12-18 12:26:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-12-18 12:26:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 54739 transitions. [2019-12-18 12:26:01,130 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 54739 transitions. Word has length 27 [2019-12-18 12:26:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:01,130 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 54739 transitions. [2019-12-18 12:26:01,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:26:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 54739 transitions. [2019-12-18 12:26:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:26:01,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:01,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:01,151 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:01,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1731527828, now seen corresponding path program 1 times [2019-12-18 12:26:01,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:01,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921496138] [2019-12-18 12:26:01,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:01,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921496138] [2019-12-18 12:26:01,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:01,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:26:01,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669600248] [2019-12-18 12:26:01,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:26:01,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:01,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:26:01,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:26:01,295 INFO L87 Difference]: Start difference. First operand 18120 states and 54739 transitions. Second operand 7 states. [2019-12-18 12:26:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:02,361 INFO L93 Difference]: Finished difference Result 24798 states and 73024 transitions. [2019-12-18 12:26:02,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:26:02,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:26:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:02,397 INFO L225 Difference]: With dead ends: 24798 [2019-12-18 12:26:02,397 INFO L226 Difference]: Without dead ends: 24798 [2019-12-18 12:26:02,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:26:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2019-12-18 12:26:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 16706. [2019-12-18 12:26:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-18 12:26:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 50524 transitions. [2019-12-18 12:26:03,259 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 50524 transitions. Word has length 33 [2019-12-18 12:26:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:03,260 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 50524 transitions. [2019-12-18 12:26:03,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:26:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 50524 transitions. [2019-12-18 12:26:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:26:03,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:03,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:03,284 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:03,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:03,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1723865273, now seen corresponding path program 1 times [2019-12-18 12:26:03,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:03,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366445978] [2019-12-18 12:26:03,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:03,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366445978] [2019-12-18 12:26:03,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:03,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:03,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957284121] [2019-12-18 12:26:03,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:03,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:03,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:03,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:03,360 INFO L87 Difference]: Start difference. First operand 16706 states and 50524 transitions. Second operand 3 states. [2019-12-18 12:26:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:03,481 INFO L93 Difference]: Finished difference Result 28297 states and 85903 transitions. [2019-12-18 12:26:03,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:03,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:26:03,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:03,516 INFO L225 Difference]: With dead ends: 28297 [2019-12-18 12:26:03,516 INFO L226 Difference]: Without dead ends: 14210 [2019-12-18 12:26:03,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-18 12:26:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 14150. [2019-12-18 12:26:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-12-18 12:26:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 42128 transitions. [2019-12-18 12:26:03,861 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 42128 transitions. Word has length 39 [2019-12-18 12:26:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:03,861 INFO L462 AbstractCegarLoop]: Abstraction has 14150 states and 42128 transitions. [2019-12-18 12:26:03,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 42128 transitions. [2019-12-18 12:26:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:26:03,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:03,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:03,887 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:03,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1940280365, now seen corresponding path program 2 times [2019-12-18 12:26:03,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:03,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103125599] [2019-12-18 12:26:03,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:03,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103125599] [2019-12-18 12:26:03,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:03,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:26:03,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977239415] [2019-12-18 12:26:03,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:03,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:03,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:03,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:03,943 INFO L87 Difference]: Start difference. First operand 14150 states and 42128 transitions. Second operand 3 states. [2019-12-18 12:26:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:03,998 INFO L93 Difference]: Finished difference Result 14149 states and 42126 transitions. [2019-12-18 12:26:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:03,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:26:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:04,024 INFO L225 Difference]: With dead ends: 14149 [2019-12-18 12:26:04,025 INFO L226 Difference]: Without dead ends: 14149 [2019-12-18 12:26:04,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-18 12:26:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 14149. [2019-12-18 12:26:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14149 states. [2019-12-18 12:26:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 42126 transitions. [2019-12-18 12:26:04,413 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 42126 transitions. Word has length 39 [2019-12-18 12:26:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:04,413 INFO L462 AbstractCegarLoop]: Abstraction has 14149 states and 42126 transitions. [2019-12-18 12:26:04,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 42126 transitions. [2019-12-18 12:26:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:26:04,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:04,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:04,448 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash 140069502, now seen corresponding path program 1 times [2019-12-18 12:26:04,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:04,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795856462] [2019-12-18 12:26:04,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:04,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795856462] [2019-12-18 12:26:04,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:04,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:26:04,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895584239] [2019-12-18 12:26:04,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:26:04,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:04,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:26:04,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:26:04,560 INFO L87 Difference]: Start difference. First operand 14149 states and 42126 transitions. Second operand 5 states. [2019-12-18 12:26:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:04,637 INFO L93 Difference]: Finished difference Result 13093 states and 39713 transitions. [2019-12-18 12:26:04,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:26:04,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:26:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:04,660 INFO L225 Difference]: With dead ends: 13093 [2019-12-18 12:26:04,660 INFO L226 Difference]: Without dead ends: 11563 [2019-12-18 12:26:04,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:26:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2019-12-18 12:26:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 11150. [2019-12-18 12:26:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-12-18 12:26:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 34836 transitions. [2019-12-18 12:26:04,884 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 34836 transitions. Word has length 40 [2019-12-18 12:26:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:04,884 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 34836 transitions. [2019-12-18 12:26:04,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:26:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 34836 transitions. [2019-12-18 12:26:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:04,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:04,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:04,897 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:04,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:04,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1749898488, now seen corresponding path program 1 times [2019-12-18 12:26:04,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:04,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867751076] [2019-12-18 12:26:04,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:04,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867751076] [2019-12-18 12:26:04,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:04,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:26:04,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841815951] [2019-12-18 12:26:04,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:04,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:04,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:04,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:04,942 INFO L87 Difference]: Start difference. First operand 11150 states and 34836 transitions. Second operand 3 states. [2019-12-18 12:26:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:05,054 INFO L93 Difference]: Finished difference Result 17888 states and 54761 transitions. [2019-12-18 12:26:05,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:05,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:26:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:05,086 INFO L225 Difference]: With dead ends: 17888 [2019-12-18 12:26:05,086 INFO L226 Difference]: Without dead ends: 17888 [2019-12-18 12:26:05,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17888 states. [2019-12-18 12:26:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17888 to 12900. [2019-12-18 12:26:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12900 states. [2019-12-18 12:26:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 39991 transitions. [2019-12-18 12:26:05,845 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 39991 transitions. Word has length 64 [2019-12-18 12:26:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:05,846 INFO L462 AbstractCegarLoop]: Abstraction has 12900 states and 39991 transitions. [2019-12-18 12:26:05,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 39991 transitions. [2019-12-18 12:26:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:05,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:05,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:05,861 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1943324054, now seen corresponding path program 1 times [2019-12-18 12:26:05,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:05,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654764909] [2019-12-18 12:26:05,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:05,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654764909] [2019-12-18 12:26:05,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:05,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:26:05,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930711032] [2019-12-18 12:26:05,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:26:05,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:05,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:26:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:26:05,961 INFO L87 Difference]: Start difference. First operand 12900 states and 39991 transitions. Second operand 7 states. [2019-12-18 12:26:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:06,441 INFO L93 Difference]: Finished difference Result 37114 states and 114341 transitions. [2019-12-18 12:26:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:26:06,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:26:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:06,481 INFO L225 Difference]: With dead ends: 37114 [2019-12-18 12:26:06,481 INFO L226 Difference]: Without dead ends: 27250 [2019-12-18 12:26:06,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:26:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27250 states. [2019-12-18 12:26:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27250 to 15594. [2019-12-18 12:26:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2019-12-18 12:26:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 48552 transitions. [2019-12-18 12:26:06,826 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 48552 transitions. Word has length 64 [2019-12-18 12:26:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:06,826 INFO L462 AbstractCegarLoop]: Abstraction has 15594 states and 48552 transitions. [2019-12-18 12:26:06,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:26:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 48552 transitions. [2019-12-18 12:26:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:06,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:06,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:06,848 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1388273988, now seen corresponding path program 2 times [2019-12-18 12:26:06,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:06,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723538393] [2019-12-18 12:26:06,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:06,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723538393] [2019-12-18 12:26:06,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:06,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:26:06,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331051625] [2019-12-18 12:26:06,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:26:06,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:06,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:26:06,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:26:06,944 INFO L87 Difference]: Start difference. First operand 15594 states and 48552 transitions. Second operand 7 states. [2019-12-18 12:26:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:07,393 INFO L93 Difference]: Finished difference Result 41160 states and 125962 transitions. [2019-12-18 12:26:07,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:26:07,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:26:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:07,436 INFO L225 Difference]: With dead ends: 41160 [2019-12-18 12:26:07,436 INFO L226 Difference]: Without dead ends: 29917 [2019-12-18 12:26:07,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:26:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29917 states. [2019-12-18 12:26:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29917 to 18174. [2019-12-18 12:26:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18174 states. [2019-12-18 12:26:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18174 states to 18174 states and 56555 transitions. [2019-12-18 12:26:08,503 INFO L78 Accepts]: Start accepts. Automaton has 18174 states and 56555 transitions. Word has length 64 [2019-12-18 12:26:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:08,504 INFO L462 AbstractCegarLoop]: Abstraction has 18174 states and 56555 transitions. [2019-12-18 12:26:08,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:26:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 18174 states and 56555 transitions. [2019-12-18 12:26:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:08,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:08,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:08,532 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:08,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1006987750, now seen corresponding path program 3 times [2019-12-18 12:26:08,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:08,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420236323] [2019-12-18 12:26:08,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:08,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420236323] [2019-12-18 12:26:08,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:08,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:08,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244178290] [2019-12-18 12:26:08,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:08,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:08,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:08,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:08,673 INFO L87 Difference]: Start difference. First operand 18174 states and 56555 transitions. Second operand 9 states. [2019-12-18 12:26:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:10,453 INFO L93 Difference]: Finished difference Result 69591 states and 211239 transitions. [2019-12-18 12:26:10,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:26:10,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:26:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:10,562 INFO L225 Difference]: With dead ends: 69591 [2019-12-18 12:26:10,562 INFO L226 Difference]: Without dead ends: 65149 [2019-12-18 12:26:10,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:26:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65149 states. [2019-12-18 12:26:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65149 to 18319. [2019-12-18 12:26:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2019-12-18 12:26:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 57144 transitions. [2019-12-18 12:26:11,192 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 57144 transitions. Word has length 64 [2019-12-18 12:26:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:11,192 INFO L462 AbstractCegarLoop]: Abstraction has 18319 states and 57144 transitions. [2019-12-18 12:26:11,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 57144 transitions. [2019-12-18 12:26:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:11,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:11,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:11,213 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1302254906, now seen corresponding path program 1 times [2019-12-18 12:26:11,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:11,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778261076] [2019-12-18 12:26:11,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:11,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778261076] [2019-12-18 12:26:11,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:11,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:26:11,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183226218] [2019-12-18 12:26:11,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:11,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:11,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:11,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:11,253 INFO L87 Difference]: Start difference. First operand 18319 states and 57144 transitions. Second operand 3 states. [2019-12-18 12:26:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:11,382 INFO L93 Difference]: Finished difference Result 23765 states and 72382 transitions. [2019-12-18 12:26:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:11,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:26:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:11,436 INFO L225 Difference]: With dead ends: 23765 [2019-12-18 12:26:11,436 INFO L226 Difference]: Without dead ends: 23765 [2019-12-18 12:26:11,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23765 states. [2019-12-18 12:26:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23765 to 18819. [2019-12-18 12:26:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18819 states. [2019-12-18 12:26:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18819 states to 18819 states and 57725 transitions. [2019-12-18 12:26:12,588 INFO L78 Accepts]: Start accepts. Automaton has 18819 states and 57725 transitions. Word has length 64 [2019-12-18 12:26:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:12,588 INFO L462 AbstractCegarLoop]: Abstraction has 18819 states and 57725 transitions. [2019-12-18 12:26:12,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 18819 states and 57725 transitions. [2019-12-18 12:26:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:12,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:12,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:12,608 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash 479548822, now seen corresponding path program 4 times [2019-12-18 12:26:12,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:12,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340248007] [2019-12-18 12:26:12,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:12,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340248007] [2019-12-18 12:26:12,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:12,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:12,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986546146] [2019-12-18 12:26:12,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:12,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:12,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:12,722 INFO L87 Difference]: Start difference. First operand 18819 states and 57725 transitions. Second operand 9 states. [2019-12-18 12:26:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:13,986 INFO L93 Difference]: Finished difference Result 63866 states and 192746 transitions. [2019-12-18 12:26:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:26:13,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:26:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:14,074 INFO L225 Difference]: With dead ends: 63866 [2019-12-18 12:26:14,074 INFO L226 Difference]: Without dead ends: 61442 [2019-12-18 12:26:14,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:26:14,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61442 states. [2019-12-18 12:26:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61442 to 18847. [2019-12-18 12:26:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18847 states. [2019-12-18 12:26:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18847 states to 18847 states and 57879 transitions. [2019-12-18 12:26:14,708 INFO L78 Accepts]: Start accepts. Automaton has 18847 states and 57879 transitions. Word has length 64 [2019-12-18 12:26:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:14,708 INFO L462 AbstractCegarLoop]: Abstraction has 18847 states and 57879 transitions. [2019-12-18 12:26:14,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18847 states and 57879 transitions. [2019-12-18 12:26:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:14,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:14,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:14,729 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:14,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1651786320, now seen corresponding path program 5 times [2019-12-18 12:26:14,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:14,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354994775] [2019-12-18 12:26:14,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:14,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354994775] [2019-12-18 12:26:14,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:14,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:14,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066314841] [2019-12-18 12:26:14,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:14,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:14,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:14,798 INFO L87 Difference]: Start difference. First operand 18847 states and 57879 transitions. Second operand 3 states. [2019-12-18 12:26:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:14,918 INFO L93 Difference]: Finished difference Result 22647 states and 69341 transitions. [2019-12-18 12:26:14,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:14,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:26:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:14,949 INFO L225 Difference]: With dead ends: 22647 [2019-12-18 12:26:14,949 INFO L226 Difference]: Without dead ends: 22647 [2019-12-18 12:26:14,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22647 states. [2019-12-18 12:26:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22647 to 19666. [2019-12-18 12:26:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19666 states. [2019-12-18 12:26:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19666 states to 19666 states and 60576 transitions. [2019-12-18 12:26:15,838 INFO L78 Accepts]: Start accepts. Automaton has 19666 states and 60576 transitions. Word has length 64 [2019-12-18 12:26:15,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:15,838 INFO L462 AbstractCegarLoop]: Abstraction has 19666 states and 60576 transitions. [2019-12-18 12:26:15,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 19666 states and 60576 transitions. [2019-12-18 12:26:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:15,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:15,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:15,861 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1362059626, now seen corresponding path program 1 times [2019-12-18 12:26:15,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:15,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631925083] [2019-12-18 12:26:15,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:15,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631925083] [2019-12-18 12:26:15,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:15,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:15,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575891795] [2019-12-18 12:26:15,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:15,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:15,973 INFO L87 Difference]: Start difference. First operand 19666 states and 60576 transitions. Second operand 9 states. [2019-12-18 12:26:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:17,185 INFO L93 Difference]: Finished difference Result 55818 states and 167465 transitions. [2019-12-18 12:26:17,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:26:17,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:26:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:17,260 INFO L225 Difference]: With dead ends: 55818 [2019-12-18 12:26:17,261 INFO L226 Difference]: Without dead ends: 52885 [2019-12-18 12:26:17,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:26:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52885 states. [2019-12-18 12:26:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52885 to 19731. [2019-12-18 12:26:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19731 states. [2019-12-18 12:26:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19731 states to 19731 states and 60809 transitions. [2019-12-18 12:26:17,799 INFO L78 Accepts]: Start accepts. Automaton has 19731 states and 60809 transitions. Word has length 65 [2019-12-18 12:26:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:17,799 INFO L462 AbstractCegarLoop]: Abstraction has 19731 states and 60809 transitions. [2019-12-18 12:26:17,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 19731 states and 60809 transitions. [2019-12-18 12:26:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:17,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:17,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:17,819 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash 938389066, now seen corresponding path program 2 times [2019-12-18 12:26:17,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:17,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310744245] [2019-12-18 12:26:17,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:17,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310744245] [2019-12-18 12:26:17,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:17,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:17,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737448630] [2019-12-18 12:26:17,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:17,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:17,934 INFO L87 Difference]: Start difference. First operand 19731 states and 60809 transitions. Second operand 9 states. [2019-12-18 12:26:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:19,935 INFO L93 Difference]: Finished difference Result 60486 states and 181076 transitions. [2019-12-18 12:26:19,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:26:19,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:26:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:20,012 INFO L225 Difference]: With dead ends: 60486 [2019-12-18 12:26:20,012 INFO L226 Difference]: Without dead ends: 57568 [2019-12-18 12:26:20,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:26:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57568 states. [2019-12-18 12:26:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57568 to 19623. [2019-12-18 12:26:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19623 states. [2019-12-18 12:26:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19623 states to 19623 states and 60279 transitions. [2019-12-18 12:26:20,568 INFO L78 Accepts]: Start accepts. Automaton has 19623 states and 60279 transitions. Word has length 65 [2019-12-18 12:26:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:20,569 INFO L462 AbstractCegarLoop]: Abstraction has 19623 states and 60279 transitions. [2019-12-18 12:26:20,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 19623 states and 60279 transitions. [2019-12-18 12:26:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:20,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:20,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:20,590 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash -848247963, now seen corresponding path program 1 times [2019-12-18 12:26:20,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:20,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326032592] [2019-12-18 12:26:20,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:20,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326032592] [2019-12-18 12:26:20,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:20,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:20,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760407852] [2019-12-18 12:26:20,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:20,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:20,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:20,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:20,665 INFO L87 Difference]: Start difference. First operand 19623 states and 60279 transitions. Second operand 3 states. [2019-12-18 12:26:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:20,764 INFO L93 Difference]: Finished difference Result 19622 states and 60277 transitions. [2019-12-18 12:26:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:20,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:26:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:20,799 INFO L225 Difference]: With dead ends: 19622 [2019-12-18 12:26:20,800 INFO L226 Difference]: Without dead ends: 19622 [2019-12-18 12:26:20,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19622 states. [2019-12-18 12:26:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19622 to 16561. [2019-12-18 12:26:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16561 states. [2019-12-18 12:26:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16561 states to 16561 states and 51733 transitions. [2019-12-18 12:26:21,079 INFO L78 Accepts]: Start accepts. Automaton has 16561 states and 51733 transitions. Word has length 65 [2019-12-18 12:26:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:21,079 INFO L462 AbstractCegarLoop]: Abstraction has 16561 states and 51733 transitions. [2019-12-18 12:26:21,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 16561 states and 51733 transitions. [2019-12-18 12:26:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:21,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:21,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:21,098 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:21,098 INFO L82 PathProgramCache]: Analyzing trace with hash -458333570, now seen corresponding path program 1 times [2019-12-18 12:26:21,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:21,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195698879] [2019-12-18 12:26:21,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:21,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195698879] [2019-12-18 12:26:21,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:21,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:21,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670685397] [2019-12-18 12:26:21,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:21,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:21,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:21,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:21,169 INFO L87 Difference]: Start difference. First operand 16561 states and 51733 transitions. Second operand 3 states. [2019-12-18 12:26:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:21,236 INFO L93 Difference]: Finished difference Result 13763 states and 41987 transitions. [2019-12-18 12:26:21,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:21,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:26:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:21,261 INFO L225 Difference]: With dead ends: 13763 [2019-12-18 12:26:21,261 INFO L226 Difference]: Without dead ends: 13763 [2019-12-18 12:26:21,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13763 states. [2019-12-18 12:26:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13763 to 12314. [2019-12-18 12:26:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12314 states. [2019-12-18 12:26:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12314 states to 12314 states and 37568 transitions. [2019-12-18 12:26:21,460 INFO L78 Accepts]: Start accepts. Automaton has 12314 states and 37568 transitions. Word has length 66 [2019-12-18 12:26:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:21,460 INFO L462 AbstractCegarLoop]: Abstraction has 12314 states and 37568 transitions. [2019-12-18 12:26:21,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 12314 states and 37568 transitions. [2019-12-18 12:26:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:21,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:21,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:21,473 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:21,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1169670237, now seen corresponding path program 1 times [2019-12-18 12:26:21,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:21,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972617343] [2019-12-18 12:26:21,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:21,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972617343] [2019-12-18 12:26:21,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:21,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:21,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178475762] [2019-12-18 12:26:21,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:26:21,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:21,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:26:21,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:26:21,640 INFO L87 Difference]: Start difference. First operand 12314 states and 37568 transitions. Second operand 10 states. [2019-12-18 12:26:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:23,821 INFO L93 Difference]: Finished difference Result 23748 states and 72005 transitions. [2019-12-18 12:26:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:26:23,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:26:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:23,850 INFO L225 Difference]: With dead ends: 23748 [2019-12-18 12:26:23,851 INFO L226 Difference]: Without dead ends: 18285 [2019-12-18 12:26:23,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:26:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18285 states. [2019-12-18 12:26:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18285 to 12800. [2019-12-18 12:26:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12800 states. [2019-12-18 12:26:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12800 states to 12800 states and 38914 transitions. [2019-12-18 12:26:24,072 INFO L78 Accepts]: Start accepts. Automaton has 12800 states and 38914 transitions. Word has length 67 [2019-12-18 12:26:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:24,072 INFO L462 AbstractCegarLoop]: Abstraction has 12800 states and 38914 transitions. [2019-12-18 12:26:24,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:26:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 12800 states and 38914 transitions. [2019-12-18 12:26:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:24,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:24,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:24,088 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1087519045, now seen corresponding path program 2 times [2019-12-18 12:26:24,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:24,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056885768] [2019-12-18 12:26:24,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:24,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056885768] [2019-12-18 12:26:24,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:24,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:26:24,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458925363] [2019-12-18 12:26:24,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:26:24,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:26:24,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:26:24,245 INFO L87 Difference]: Start difference. First operand 12800 states and 38914 transitions. Second operand 11 states. [2019-12-18 12:26:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:26,196 INFO L93 Difference]: Finished difference Result 22768 states and 68521 transitions. [2019-12-18 12:26:26,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:26:26,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:26:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:26,223 INFO L225 Difference]: With dead ends: 22768 [2019-12-18 12:26:26,223 INFO L226 Difference]: Without dead ends: 18941 [2019-12-18 12:26:26,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:26:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18941 states. [2019-12-18 12:26:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18941 to 12836. [2019-12-18 12:26:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12836 states. [2019-12-18 12:26:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12836 states to 12836 states and 38868 transitions. [2019-12-18 12:26:26,468 INFO L78 Accepts]: Start accepts. Automaton has 12836 states and 38868 transitions. Word has length 67 [2019-12-18 12:26:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:26,468 INFO L462 AbstractCegarLoop]: Abstraction has 12836 states and 38868 transitions. [2019-12-18 12:26:26,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:26:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 12836 states and 38868 transitions. [2019-12-18 12:26:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:26,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:26,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:26,488 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1951872541, now seen corresponding path program 3 times [2019-12-18 12:26:26,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:26,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754276361] [2019-12-18 12:26:26,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:27,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754276361] [2019-12-18 12:26:27,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:27,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 12:26:27,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983753182] [2019-12-18 12:26:27,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 12:26:27,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:27,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 12:26:27,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:26:27,121 INFO L87 Difference]: Start difference. First operand 12836 states and 38868 transitions. Second operand 14 states. [2019-12-18 12:26:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:32,583 INFO L93 Difference]: Finished difference Result 23665 states and 71499 transitions. [2019-12-18 12:26:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 12:26:32,584 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 12:26:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:32,614 INFO L225 Difference]: With dead ends: 23665 [2019-12-18 12:26:32,614 INFO L226 Difference]: Without dead ends: 22274 [2019-12-18 12:26:32,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=1096, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 12:26:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22274 states. [2019-12-18 12:26:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22274 to 15140. [2019-12-18 12:26:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15140 states. [2019-12-18 12:26:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15140 states to 15140 states and 45454 transitions. [2019-12-18 12:26:32,880 INFO L78 Accepts]: Start accepts. Automaton has 15140 states and 45454 transitions. Word has length 67 [2019-12-18 12:26:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:32,880 INFO L462 AbstractCegarLoop]: Abstraction has 15140 states and 45454 transitions. [2019-12-18 12:26:32,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 12:26:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15140 states and 45454 transitions. [2019-12-18 12:26:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:32,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:32,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:32,901 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:32,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1574036275, now seen corresponding path program 4 times [2019-12-18 12:26:32,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:32,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661794672] [2019-12-18 12:26:32,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26: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-18 12:26:33,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661794672] [2019-12-18 12:26:33,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:33,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 12:26:33,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914288614] [2019-12-18 12:26:33,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 12:26:33,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 12:26:33,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:26:33,484 INFO L87 Difference]: Start difference. First operand 15140 states and 45454 transitions. Second operand 14 states. [2019-12-18 12:26:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:38,579 INFO L93 Difference]: Finished difference Result 22814 states and 68327 transitions. [2019-12-18 12:26:38,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 12:26:38,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 12:26:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:38,606 INFO L225 Difference]: With dead ends: 22814 [2019-12-18 12:26:38,606 INFO L226 Difference]: Without dead ends: 18819 [2019-12-18 12:26:38,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 12:26:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18819 states. [2019-12-18 12:26:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18819 to 12400. [2019-12-18 12:26:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12400 states. [2019-12-18 12:26:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12400 states to 12400 states and 37472 transitions. [2019-12-18 12:26:38,838 INFO L78 Accepts]: Start accepts. Automaton has 12400 states and 37472 transitions. Word has length 67 [2019-12-18 12:26:38,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:38,838 INFO L462 AbstractCegarLoop]: Abstraction has 12400 states and 37472 transitions. [2019-12-18 12:26:38,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 12:26:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 12400 states and 37472 transitions. [2019-12-18 12:26:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:38,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:38,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:38,852 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:38,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1709159453, now seen corresponding path program 5 times [2019-12-18 12:26:38,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:38,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375128847] [2019-12-18 12:26:38,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:39,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375128847] [2019-12-18 12:26:39,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:39,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:26:39,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37188502] [2019-12-18 12:26:39,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:26:39,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:26:39,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:26:39,370 INFO L87 Difference]: Start difference. First operand 12400 states and 37472 transitions. Second operand 15 states. [2019-12-18 12:26:43,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:43,946 INFO L93 Difference]: Finished difference Result 18892 states and 56993 transitions. [2019-12-18 12:26:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 12:26:43,946 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 12:26:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:43,971 INFO L225 Difference]: With dead ends: 18892 [2019-12-18 12:26:43,972 INFO L226 Difference]: Without dead ends: 18665 [2019-12-18 12:26:43,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 12:26:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18665 states. [2019-12-18 12:26:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18665 to 12224. [2019-12-18 12:26:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2019-12-18 12:26:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 36988 transitions. [2019-12-18 12:26:44,699 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 36988 transitions. Word has length 67 [2019-12-18 12:26:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:44,699 INFO L462 AbstractCegarLoop]: Abstraction has 12224 states and 36988 transitions. [2019-12-18 12:26:44,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:26:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 36988 transitions. [2019-12-18 12:26:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:44,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:44,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:44,711 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:44,711 INFO L82 PathProgramCache]: Analyzing trace with hash 656134515, now seen corresponding path program 6 times [2019-12-18 12:26:44,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:44,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325844403] [2019-12-18 12:26:44,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:26:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:26:44,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:26:44,852 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:26:44,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~a$r_buff1_thd0~0_203 0) (= 0 v_~a$r_buff1_thd1~0_191) (= v_~z~0_36 0) (= 0 |v_ULTIMATE.start_main_~#t281~0.offset_26|) (= v_~a$r_buff0_thd0~0_228 0) (= 0 v_~a$r_buff0_thd1~0_317) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~main$tmp_guard1~0_42 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t281~0.base_37|) (= v_~a$r_buff0_thd3~0_430 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= (select .cse0 |v_ULTIMATE.start_main_~#t281~0.base_37|) 0) (= v_~__unbuffered_cnt~0_111 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x~0_176) (= v_~__unbuffered_p1_EBX~0_55 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t281~0.base_37| 4)) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t281~0.base_37| 1)) (= 0 |v_#NULL.base_4|) (= v_~a$mem_tmp~0_16 0) (= 0 v_~a$w_buff0_used~0_889) (= v_~a$w_buff0~0_416 0) (= v_~a$r_buff1_thd3~0_333 0) (= 0 v_~a$w_buff1_used~0_596) (= |v_#NULL.offset_4| 0) (= 0 v_~a$w_buff1~0_333) (= 0 v_~a$r_buff1_thd2~0_185) (= v_~a~0_191 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~weak$$choice0~0_13) (= v_~weak$$choice2~0_131 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t281~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t281~0.base_37|) |v_ULTIMATE.start_main_~#t281~0.offset_26| 0)) |v_#memory_int_23|) (= v_~y~0_31 0) (= 0 v_~a$read_delayed~0_8) (= v_~a$flush_delayed~0_26 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t282~0.base=|v_ULTIMATE.start_main_~#t282~0.base_38|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_59|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_228, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_127|, ~a~0=v_~a~0_191, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_~#t283~0.offset=|v_ULTIMATE.start_main_~#t283~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_333, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_889, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_317, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_416, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_203, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~x~0=v_~x~0_176, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_67|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~a$w_buff1~0=v_~a$w_buff1~0_333, ULTIMATE.start_main_~#t283~0.base=|v_ULTIMATE.start_main_~#t283~0.base_30|, ~y~0=v_~y~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_55, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_191, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_430, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t282~0.offset=|v_ULTIMATE.start_main_~#t282~0.offset_26|, ULTIMATE.start_main_~#t281~0.base=|v_ULTIMATE.start_main_~#t281~0.base_37|, ~a$flush_delayed~0=v_~a$flush_delayed~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_36, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_596, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t281~0.offset=|v_ULTIMATE.start_main_~#t281~0.offset_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t282~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t283~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t283~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t282~0.offset, ULTIMATE.start_main_~#t281~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t281~0.offset] because there is no mapped edge [2019-12-18 12:26:44,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t282~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t282~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t282~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t282~0.base_13|) |v_ULTIMATE.start_main_~#t282~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t282~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t282~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t282~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t282~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t282~0.base=|v_ULTIMATE.start_main_~#t282~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t282~0.offset=|v_ULTIMATE.start_main_~#t282~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t282~0.offset] because there is no mapped edge [2019-12-18 12:26:44,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= v_~a$r_buff0_thd1~0_28 v_~a$r_buff1_thd1~0_23) (= v_~a$r_buff0_thd2~0_20 v_~a$r_buff1_thd2~0_16) (= v_~a$r_buff0_thd0~0_18 v_~a$r_buff1_thd0~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~a$r_buff0_thd1~0_27 1) (= 1 v_~x~0_7) (= v_~a$r_buff0_thd3~0_73 v_~a$r_buff1_thd3~0_40)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:26:44,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In1854435438 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1854435438 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1854435438| ~a~0_In1854435438) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1854435438 |P1Thread1of1ForFork2_#t~ite9_Out1854435438|)))) InVars {~a~0=~a~0_In1854435438, ~a$w_buff1~0=~a$w_buff1~0_In1854435438, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1854435438, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1854435438} OutVars{~a~0=~a~0_In1854435438, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1854435438|, ~a$w_buff1~0=~a$w_buff1~0_In1854435438, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1854435438, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1854435438} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:26:44,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_47) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_47, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:26:44,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1745783145 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1745783145 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1745783145 |P0Thread1of1ForFork1_#t~ite5_Out-1745783145|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1745783145|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745783145, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1745783145} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1745783145|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1745783145, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1745783145} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:26:44,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1593018110 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1593018110 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1593018110 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1593018110 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out1593018110| ~a$w_buff1_used~0_In1593018110)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out1593018110| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1593018110, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1593018110, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1593018110, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1593018110} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1593018110|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1593018110, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1593018110, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1593018110, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1593018110} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:26:44,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-267354685 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-267354685 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-267354685)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_In-267354685 ~a$r_buff0_thd1~0_Out-267354685)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-267354685, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-267354685} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-267354685|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-267354685, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-267354685} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:26:44,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-156677204 256))) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-156677204 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-156677204 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-156677204 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-156677204 |P0Thread1of1ForFork1_#t~ite8_Out-156677204|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-156677204|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-156677204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-156677204, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-156677204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-156677204} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-156677204|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-156677204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-156677204, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-156677204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-156677204} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:26:44,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L754-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_148 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_148, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:26:44,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L837-1-->L839: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t283~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t283~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t283~0.base_12| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t283~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t283~0.base_12| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t283~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t283~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t283~0.base_12|) |v_ULTIMATE.start_main_~#t283~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t283~0.base=|v_ULTIMATE.start_main_~#t283~0.base_12|, #length=|v_#length_15|, ULTIMATE.start_main_~#t283~0.offset=|v_ULTIMATE.start_main_~#t283~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t283~0.base, #length, ULTIMATE.start_main_~#t283~0.offset] because there is no mapped edge [2019-12-18 12:26:44,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1003159447 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out1003159447| |P2Thread1of1ForFork0_#t~ite20_Out1003159447|) (= ~a$w_buff0~0_In1003159447 |P2Thread1of1ForFork0_#t~ite20_Out1003159447|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1003159447 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In1003159447 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In1003159447 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1003159447 256)))))) (and (= |P2Thread1of1ForFork0_#t~ite20_In1003159447| |P2Thread1of1ForFork0_#t~ite20_Out1003159447|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out1003159447| ~a$w_buff0~0_In1003159447)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1003159447, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1003159447, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1003159447, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1003159447, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1003159447, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1003159447|, ~weak$$choice2~0=~weak$$choice2~0_In1003159447} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1003159447|, ~a$w_buff0~0=~a$w_buff0~0_In1003159447, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1003159447, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1003159447, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1003159447, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1003159447|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1003159447, ~weak$$choice2~0=~weak$$choice2~0_In1003159447} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:26:44,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-175092058 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-175092058| |P2Thread1of1ForFork0_#t~ite26_Out-175092058|) (= |P2Thread1of1ForFork0_#t~ite27_Out-175092058| ~a$w_buff0_used~0_In-175092058)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-175092058| |P2Thread1of1ForFork0_#t~ite26_Out-175092058|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-175092058 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-175092058 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In-175092058 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-175092058 256)))) (= ~a$w_buff0_used~0_In-175092058 |P2Thread1of1ForFork0_#t~ite26_Out-175092058|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-175092058|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-175092058, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-175092058, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-175092058, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-175092058, ~weak$$choice2~0=~weak$$choice2~0_In-175092058} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-175092058|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-175092058|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-175092058, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-175092058, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-175092058, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-175092058, ~weak$$choice2~0=~weak$$choice2~0_In-175092058} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:26:44,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L804-->L804-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1481101824 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1481101824 256)))) (or (and .cse0 (= (mod ~a$w_buff1_used~0_In-1481101824 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1481101824 256)) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In-1481101824 256) 0)))) (= ~a$w_buff1_used~0_In-1481101824 |P2Thread1of1ForFork0_#t~ite29_Out-1481101824|) .cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out-1481101824| |P2Thread1of1ForFork0_#t~ite30_Out-1481101824|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_In-1481101824| |P2Thread1of1ForFork0_#t~ite29_Out-1481101824|) (= ~a$w_buff1_used~0_In-1481101824 |P2Thread1of1ForFork0_#t~ite30_Out-1481101824|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1481101824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1481101824, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1481101824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1481101824, ~weak$$choice2~0=~weak$$choice2~0_In-1481101824, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1481101824|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1481101824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1481101824, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1481101824, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1481101824|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1481101824, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1481101824|, ~weak$$choice2~0=~weak$$choice2~0_In-1481101824} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:26:44,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~a$r_buff0_thd3~0_136 v_~a$r_buff0_thd3~0_135)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_135, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:26:44,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_12 0) (= v_~a~0_57 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_13 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_13} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_57, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:26:44,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1802257968 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1802257968 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1802257968 |P2Thread1of1ForFork0_#t~ite38_Out1802257968|)) (and (or .cse0 .cse1) (= ~a~0_In1802257968 |P2Thread1of1ForFork0_#t~ite38_Out1802257968|)))) InVars {~a~0=~a~0_In1802257968, ~a$w_buff1~0=~a$w_buff1~0_In1802257968, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1802257968, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1802257968} OutVars{~a~0=~a~0_In1802257968, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1802257968|, ~a$w_buff1~0=~a$w_buff1~0_In1802257968, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1802257968, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1802257968} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:26:44,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_20, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:26:44,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2037736700 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-2037736700 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2037736700 |P2Thread1of1ForFork0_#t~ite40_Out-2037736700|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-2037736700|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037736700, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2037736700} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-2037736700|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037736700, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2037736700} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:26:44,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-755884683 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-755884683 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-755884683 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-755884683 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-755884683|)) (and (= ~a$w_buff1_used~0_In-755884683 |P2Thread1of1ForFork0_#t~ite41_Out-755884683|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-755884683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-755884683, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-755884683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-755884683} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-755884683, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-755884683, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-755884683, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-755884683, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-755884683|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:26:44,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-376505691 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-376505691 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-376505691| ~a$r_buff0_thd3~0_In-376505691)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-376505691|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-376505691, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-376505691} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-376505691, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-376505691, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-376505691|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:26:44,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-600891876 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-600891876 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-600891876 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-600891876 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-600891876|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-600891876 |P2Thread1of1ForFork0_#t~ite43_Out-600891876|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-600891876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-600891876, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-600891876, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-600891876} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-600891876|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-600891876, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-600891876, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-600891876, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-600891876} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:26:44,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= v_~a$r_buff1_thd3~0_122 |v_P2Thread1of1ForFork0_#t~ite43_34|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:26:44,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1493060747 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1493060747 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1493060747| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1493060747| ~a$w_buff0_used~0_In1493060747)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1493060747, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1493060747} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1493060747, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1493060747, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1493060747|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:26:44,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In858172812 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In858172812 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In858172812 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In858172812 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out858172812| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out858172812| ~a$w_buff1_used~0_In858172812)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In858172812, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In858172812, ~a$w_buff0_used~0=~a$w_buff0_used~0_In858172812, ~a$w_buff1_used~0=~a$w_buff1_used~0_In858172812} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In858172812, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In858172812, ~a$w_buff0_used~0=~a$w_buff0_used~0_In858172812, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out858172812|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In858172812} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:26:44,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1141200539 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1141200539 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1141200539|)) (and (= ~a$r_buff0_thd2~0_In1141200539 |P1Thread1of1ForFork2_#t~ite13_Out1141200539|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1141200539, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1141200539} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1141200539, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1141200539, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1141200539|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:26:44,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd2~0_In-1575635864 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1575635864 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1575635864 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1575635864 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1575635864|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-1575635864 |P1Thread1of1ForFork2_#t~ite14_Out-1575635864|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1575635864, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1575635864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1575635864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1575635864} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1575635864, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1575635864, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1575635864, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1575635864, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1575635864|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:26:44,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L780-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_79) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:26:44,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:26:44,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1800938152 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1800938152 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1800938152| ~a$w_buff1~0_In-1800938152) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1800938152| ~a~0_In-1800938152)))) InVars {~a~0=~a~0_In-1800938152, ~a$w_buff1~0=~a$w_buff1~0_In-1800938152, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1800938152, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1800938152} OutVars{~a~0=~a~0_In-1800938152, ~a$w_buff1~0=~a$w_buff1~0_In-1800938152, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1800938152|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1800938152, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1800938152} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:26:44,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_30 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_30, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:26:44,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-630647716 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-630647716 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-630647716| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-630647716| ~a$w_buff0_used~0_In-630647716)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-630647716, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-630647716} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-630647716, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-630647716|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-630647716} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:26:44,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-650145266 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-650145266 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-650145266 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-650145266 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-650145266|)) (and (= ~a$w_buff1_used~0_In-650145266 |ULTIMATE.start_main_#t~ite50_Out-650145266|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-650145266, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-650145266, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-650145266, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-650145266} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-650145266|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-650145266, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-650145266, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-650145266, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-650145266} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:26:44,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1780703445 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1780703445 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1780703445 |ULTIMATE.start_main_#t~ite51_Out1780703445|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1780703445|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1780703445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1780703445} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1780703445|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1780703445, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1780703445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:26:44,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In854374781 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In854374781 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In854374781 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In854374781 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out854374781| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out854374781| ~a$r_buff1_thd0~0_In854374781) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In854374781, ~a$w_buff0_used~0=~a$w_buff0_used~0_In854374781, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In854374781, ~a$w_buff1_used~0=~a$w_buff1_used~0_In854374781} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out854374781|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In854374781, ~a$w_buff0_used~0=~a$w_buff0_used~0_In854374781, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In854374781, ~a$w_buff1_used~0=~a$w_buff1_used~0_In854374781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:26:44,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~main$tmp_guard1~0_18 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_~a$r_buff1_thd0~0_158 |v_ULTIMATE.start_main_#t~ite52_40|) (= 2 v_~x~0_125) (= v_~__unbuffered_p1_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_18 256)) (= v_~__unbuffered_p2_EBX~0_24 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_158, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:26:44,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:26:44 BasicIcfg [2019-12-18 12:26:44,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:26:44,986 INFO L168 Benchmark]: Toolchain (without parser) took 120658.90 ms. Allocated memory was 137.4 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 100.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 12:26:44,986 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:26:44,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.32 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 156.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:44,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.64 ms. Allocated memory is still 201.9 MB. Free memory was 156.5 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:44,989 INFO L168 Benchmark]: Boogie Preprocessor took 40.50 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:44,991 INFO L168 Benchmark]: RCFGBuilder took 858.90 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 101.0 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:44,992 INFO L168 Benchmark]: TraceAbstraction took 118914.27 ms. Allocated memory was 201.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 100.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 12:26:44,994 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.76 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.32 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 156.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.64 ms. Allocated memory is still 201.9 MB. Free memory was 156.5 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.50 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 858.90 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 101.0 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118914.27 ms. Allocated memory was 201.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 100.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7568 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 90866 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L839] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=2, y=1, z=1] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L812] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.5s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6984 SDtfs, 9599 SDslu, 27194 SDs, 0 SdLazy, 21286 SolverSat, 494 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 42 SyntacticMatches, 19 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162755occurred 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: 44.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 289008 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 264511 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...