/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:39:49,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:39:49,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:39:49,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:39:49,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:39:49,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:39:49,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:39:49,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:39:49,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:39:49,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:39:49,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:39:49,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:39:49,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:39:49,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:39:49,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:39:49,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:39:49,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:39:49,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:39:49,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:39:49,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:39:49,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:39:49,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:39:49,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:39:49,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:39:49,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:39:49,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:39:49,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:39:49,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:39:49,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:39:49,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:39:49,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:39:49,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:39:49,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:39:49,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:39:49,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:39:49,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:39:49,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:39:49,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:39:49,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:39:49,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:39:49,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:39:49,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:39:49,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:39:49,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:39:49,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:39:49,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:39:49,129 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:39:49,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:39:49,130 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:39:49,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:39:49,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:39:49,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:39:49,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:39:49,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:39:49,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:39:49,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:39:49,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:39:49,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:39:49,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:39:49,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:39:49,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:39:49,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:39:49,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:39:49,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:39:49,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:39:49,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:39:49,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:39:49,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:39:49,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:39:49,134 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:39:49,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:39:49,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:39:49,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:39:49,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:39:49,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:39:49,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:39:49,423 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:39:49,424 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-27 05:39:49,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11e954ab/054f11de6e0543b695c31568a8097d64/FLAGf50aca245 [2019-12-27 05:39:49,992 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:39:49,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-27 05:39:50,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11e954ab/054f11de6e0543b695c31568a8097d64/FLAGf50aca245 [2019-12-27 05:39:50,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11e954ab/054f11de6e0543b695c31568a8097d64 [2019-12-27 05:39:50,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:39:50,287 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:39:50,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:39:50,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:39:50,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:39:50,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:39:50" (1/1) ... [2019-12-27 05:39:50,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:50, skipping insertion in model container [2019-12-27 05:39:50,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:39:50" (1/1) ... [2019-12-27 05:39:50,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:39:50,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:39:50,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:39:50,966 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:39:51,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:39:51,099 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:39:51,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51 WrapperNode [2019-12-27 05:39:51,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:39:51,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:39:51,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:39:51,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:39:51,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... [2019-12-27 05:39:51,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... [2019-12-27 05:39:51,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:39:51,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:39:51,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:39:51,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:39:51,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... [2019-12-27 05:39:51,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... [2019-12-27 05:39:51,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... [2019-12-27 05:39:51,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... [2019-12-27 05:39:51,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... [2019-12-27 05:39:51,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... [2019-12-27 05:39:51,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... [2019-12-27 05:39:51,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:39:51,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:39:51,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:39:51,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:39:51,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:39:51,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:39:51,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:39:51,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:39:51,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:39:51,357 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:39:51,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:39:51,357 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:39:51,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:39:51,358 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:39:51,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:39:51,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:39:51,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:39:51,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:39:51,360 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:39:52,109 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:39:52,109 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:39:52,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:39:52 BoogieIcfgContainer [2019-12-27 05:39:52,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:39:52,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:39:52,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:39:52,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:39:52,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:39:50" (1/3) ... [2019-12-27 05:39:52,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8f9712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:39:52, skipping insertion in model container [2019-12-27 05:39:52,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:39:51" (2/3) ... [2019-12-27 05:39:52,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8f9712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:39:52, skipping insertion in model container [2019-12-27 05:39:52,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:39:52" (3/3) ... [2019-12-27 05:39:52,120 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_pso.oepc.i [2019-12-27 05:39:52,131 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:39:52,131 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:39:52,140 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:39:52,141 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:39:52,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,203 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,230 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,230 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,237 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,237 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,265 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,267 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:39:52,298 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:39:52,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:39:52,319 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:39:52,319 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:39:52,319 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:39:52,319 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:39:52,319 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:39:52,320 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:39:52,320 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:39:52,337 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 05:39:52,339 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:39:52,442 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:39:52,443 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:39:52,463 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:39:52,501 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:39:52,562 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:39:52,562 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:39:52,575 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:39:52,602 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:39:52,604 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:39:55,633 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 05:39:56,269 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 05:39:56,412 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 05:39:56,436 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-27 05:39:56,436 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 05:39:56,440 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 05:40:16,565 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-27 05:40:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-27 05:40:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:40:16,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:40:16,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:40:16,576 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-27 05:40:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:40:16,581 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-27 05:40:16,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:40:16,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768859603] [2019-12-27 05:40:16,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:40:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:40:16,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-27 05:40:16,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768859603] [2019-12-27 05:40:16,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:40:16,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:40:16,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23461702] [2019-12-27 05:40:16,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:40:16,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:40:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:40:16,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:40:16,854 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-27 05:40:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:40:20,075 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-27 05:40:20,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:40:20,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:40:20,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:40:20,872 INFO L225 Difference]: With dead ends: 120482 [2019-12-27 05:40:20,873 INFO L226 Difference]: Without dead ends: 113384 [2019-12-27 05:40:20,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:40:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-27 05:40:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-27 05:40:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-27 05:40:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-27 05:40:31,020 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-27 05:40:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:40:31,020 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-27 05:40:31,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:40:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-27 05:40:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:40:31,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:40:31,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:40:31,025 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-27 05:40:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:40:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-27 05:40:31,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:40:31,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725010831] [2019-12-27 05:40:31,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:40:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:40:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:40:31,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725010831] [2019-12-27 05:40:31,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:40:31,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:40:31,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713162097] [2019-12-27 05:40:31,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:40:31,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:40:31,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:40:31,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:40:31,182 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-27 05:40:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:40:36,510 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-27 05:40:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:40:36,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:40:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:40:37,104 INFO L225 Difference]: With dead ends: 179498 [2019-12-27 05:40:37,104 INFO L226 Difference]: Without dead ends: 179449 [2019-12-27 05:40:37,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:40:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-27 05:40:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-27 05:40:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-27 05:40:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-27 05:40:51,192 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-27 05:40:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:40:51,193 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-27 05:40:51,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:40:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-27 05:40:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:40:51,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:40:51,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:40:51,201 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-27 05:40:51,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:40:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-27 05:40:51,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:40:51,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446146847] [2019-12-27 05:40:51,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:40:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:40:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:40:51,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446146847] [2019-12-27 05:40:51,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:40:51,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:40:51,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089351283] [2019-12-27 05:40:51,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:40:51,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:40:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:40:51,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:40:51,280 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-27 05:40:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:40:51,405 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-27 05:40:51,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:40:51,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:40:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:40:51,493 INFO L225 Difference]: With dead ends: 34413 [2019-12-27 05:40:51,494 INFO L226 Difference]: Without dead ends: 34413 [2019-12-27 05:40:51,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:40:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-27 05:40:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-27 05:40:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-27 05:40:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-27 05:40:57,044 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-27 05:40:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:40:57,044 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-27 05:40:57,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:40:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-27 05:40:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:40:57,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:40:57,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:40:57,049 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-27 05:40:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:40:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-27 05:40:57,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:40:57,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800368560] [2019-12-27 05:40:57,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:40:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:40:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:40:57,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800368560] [2019-12-27 05:40:57,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:40:57,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:40:57,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424732475] [2019-12-27 05:40:57,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:40:57,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:40:57,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:40:57,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:40:57,119 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-27 05:40:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:40:57,372 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-27 05:40:57,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:40:57,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 05:40:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:40:57,461 INFO L225 Difference]: With dead ends: 54627 [2019-12-27 05:40:57,461 INFO L226 Difference]: Without dead ends: 54627 [2019-12-27 05:40:57,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:40:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-27 05:40:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-27 05:40:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-27 05:40:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-27 05:40:58,673 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-27 05:40:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:40:58,674 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-27 05:40:58,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:40:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-27 05:40:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:40:58,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:40:58,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:40:58,678 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-27 05:40:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:40:58,678 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-27 05:40:58,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:40:58,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020916243] [2019-12-27 05:40:58,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:40:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:40:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:40:58,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020916243] [2019-12-27 05:40:58,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:40:58,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:40:58,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167918749] [2019-12-27 05:40:58,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:40:58,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:40:58,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:40:58,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:40:58,768 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-27 05:40:59,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:40:59,148 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-27 05:40:59,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:40:59,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:40:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:40:59,226 INFO L225 Difference]: With dead ends: 48927 [2019-12-27 05:40:59,226 INFO L226 Difference]: Without dead ends: 48927 [2019-12-27 05:40:59,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:40:59,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-27 05:40:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-27 05:40:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-27 05:41:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-27 05:41:00,024 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-27 05:41:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:00,025 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-27 05:41:00,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:41:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-27 05:41:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:41:00,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:00,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:41:00,029 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-27 05:41:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:00,029 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-27 05:41:00,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:00,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208179962] [2019-12-27 05:41:00,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:00,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208179962] [2019-12-27 05:41:00,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:00,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:41:00,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671399283] [2019-12-27 05:41:00,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:41:00,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:00,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:41:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:41:00,103 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-27 05:41:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:00,792 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-27 05:41:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:41:00,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:41:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:00,890 INFO L225 Difference]: With dead ends: 53251 [2019-12-27 05:41:00,890 INFO L226 Difference]: Without dead ends: 53251 [2019-12-27 05:41:00,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-27 05:41:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-27 05:41:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-27 05:41:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-27 05:41:01,688 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-27 05:41:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:01,689 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-27 05:41:01,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:41:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-27 05:41:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:41:01,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:01,698 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-27 05:41:01,698 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-27 05:41:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-27 05:41:01,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:01,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75477866] [2019-12-27 05:41:01,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:01,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75477866] [2019-12-27 05:41:01,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:01,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:41:01,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168217796] [2019-12-27 05:41:01,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:41:01,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:01,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:41:01,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:01,813 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 5 states. [2019-12-27 05:41:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:02,506 INFO L93 Difference]: Finished difference Result 63192 states and 200300 transitions. [2019-12-27 05:41:02,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:41:02,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:41:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:03,075 INFO L225 Difference]: With dead ends: 63192 [2019-12-27 05:41:03,075 INFO L226 Difference]: Without dead ends: 63185 [2019-12-27 05:41:03,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:41:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63185 states. [2019-12-27 05:41:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63185 to 47511. [2019-12-27 05:41:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47511 states. [2019-12-27 05:41:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47511 states to 47511 states and 154018 transitions. [2019-12-27 05:41:03,996 INFO L78 Accepts]: Start accepts. Automaton has 47511 states and 154018 transitions. Word has length 22 [2019-12-27 05:41:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:03,996 INFO L462 AbstractCegarLoop]: Abstraction has 47511 states and 154018 transitions. [2019-12-27 05:41:03,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:41:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 47511 states and 154018 transitions. [2019-12-27 05:41:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:41:04,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:04,006 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-27 05:41:04,006 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-27 05:41:04,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-27 05:41:04,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:04,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339156574] [2019-12-27 05:41:04,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:04,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339156574] [2019-12-27 05:41:04,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:04,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:41:04,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225120426] [2019-12-27 05:41:04,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:41:04,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:04,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:41:04,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:04,096 INFO L87 Difference]: Start difference. First operand 47511 states and 154018 transitions. Second operand 5 states. [2019-12-27 05:41:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:04,764 INFO L93 Difference]: Finished difference Result 65538 states and 207239 transitions. [2019-12-27 05:41:04,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:41:04,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:41:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:04,880 INFO L225 Difference]: With dead ends: 65538 [2019-12-27 05:41:04,880 INFO L226 Difference]: Without dead ends: 65531 [2019-12-27 05:41:04,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:41:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65531 states. [2019-12-27 05:41:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65531 to 45771. [2019-12-27 05:41:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45771 states. [2019-12-27 05:41:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45771 states to 45771 states and 148366 transitions. [2019-12-27 05:41:06,274 INFO L78 Accepts]: Start accepts. Automaton has 45771 states and 148366 transitions. Word has length 22 [2019-12-27 05:41:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:06,274 INFO L462 AbstractCegarLoop]: Abstraction has 45771 states and 148366 transitions. [2019-12-27 05:41:06,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:41:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 45771 states and 148366 transitions. [2019-12-27 05:41:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:41:06,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:06,287 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-27 05:41:06,287 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-27 05:41:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-27 05:41:06,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:06,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306180781] [2019-12-27 05:41:06,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:06,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306180781] [2019-12-27 05:41:06,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:06,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:41:06,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810868363] [2019-12-27 05:41:06,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:41:06,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:06,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:41:06,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:41:06,345 INFO L87 Difference]: Start difference. First operand 45771 states and 148366 transitions. Second operand 4 states. [2019-12-27 05:41:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:06,440 INFO L93 Difference]: Finished difference Result 17755 states and 54382 transitions. [2019-12-27 05:41:06,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:41:06,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:41:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:06,482 INFO L225 Difference]: With dead ends: 17755 [2019-12-27 05:41:06,482 INFO L226 Difference]: Without dead ends: 17755 [2019-12-27 05:41:06,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:41:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17755 states. [2019-12-27 05:41:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17755 to 17427. [2019-12-27 05:41:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17427 states. [2019-12-27 05:41:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17427 states to 17427 states and 53446 transitions. [2019-12-27 05:41:06,835 INFO L78 Accepts]: Start accepts. Automaton has 17427 states and 53446 transitions. Word has length 25 [2019-12-27 05:41:06,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:06,836 INFO L462 AbstractCegarLoop]: Abstraction has 17427 states and 53446 transitions. [2019-12-27 05:41:06,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:41:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17427 states and 53446 transitions. [2019-12-27 05:41:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:41:06,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:06,849 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-27 05:41:06,849 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-27 05:41:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-27 05:41:06,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:06,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495492391] [2019-12-27 05:41:06,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:06,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495492391] [2019-12-27 05:41:06,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:06,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:41:06,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733516748] [2019-12-27 05:41:06,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:41:06,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:06,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:41:06,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:06,974 INFO L87 Difference]: Start difference. First operand 17427 states and 53446 transitions. Second operand 5 states. [2019-12-27 05:41:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:07,341 INFO L93 Difference]: Finished difference Result 22078 states and 66584 transitions. [2019-12-27 05:41:07,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:41:07,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 05:41:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:07,374 INFO L225 Difference]: With dead ends: 22078 [2019-12-27 05:41:07,374 INFO L226 Difference]: Without dead ends: 22078 [2019-12-27 05:41:07,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:41:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22078 states. [2019-12-27 05:41:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22078 to 20690. [2019-12-27 05:41:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20690 states. [2019-12-27 05:41:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 63094 transitions. [2019-12-27 05:41:07,945 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 63094 transitions. Word has length 27 [2019-12-27 05:41:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:07,945 INFO L462 AbstractCegarLoop]: Abstraction has 20690 states and 63094 transitions. [2019-12-27 05:41:07,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:41:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 63094 transitions. [2019-12-27 05:41:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:41:07,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:07,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:41:07,961 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-27 05:41:07,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-27 05:41:07,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:07,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339424151] [2019-12-27 05:41:07,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:08,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339424151] [2019-12-27 05:41:08,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:08,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:41:08,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473579037] [2019-12-27 05:41:08,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:41:08,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:08,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:41:08,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:08,073 INFO L87 Difference]: Start difference. First operand 20690 states and 63094 transitions. Second operand 5 states. [2019-12-27 05:41:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:08,204 INFO L93 Difference]: Finished difference Result 21192 states and 64429 transitions. [2019-12-27 05:41:08,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:41:08,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:41:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:08,237 INFO L225 Difference]: With dead ends: 21192 [2019-12-27 05:41:08,237 INFO L226 Difference]: Without dead ends: 21192 [2019-12-27 05:41:08,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21192 states. [2019-12-27 05:41:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21192 to 21192. [2019-12-27 05:41:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21192 states. [2019-12-27 05:41:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21192 states to 21192 states and 64429 transitions. [2019-12-27 05:41:08,566 INFO L78 Accepts]: Start accepts. Automaton has 21192 states and 64429 transitions. Word has length 28 [2019-12-27 05:41:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:08,566 INFO L462 AbstractCegarLoop]: Abstraction has 21192 states and 64429 transitions. [2019-12-27 05:41:08,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:41:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 21192 states and 64429 transitions. [2019-12-27 05:41:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 05:41:08,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:08,584 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] [2019-12-27 05:41:08,584 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-27 05:41:08,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-27 05:41:08,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:08,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87597068] [2019-12-27 05:41:08,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:08,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87597068] [2019-12-27 05:41:08,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:08,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:41:08,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775963062] [2019-12-27 05:41:08,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:41:08,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:41:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:08,664 INFO L87 Difference]: Start difference. First operand 21192 states and 64429 transitions. Second operand 5 states. [2019-12-27 05:41:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:09,056 INFO L93 Difference]: Finished difference Result 24492 states and 73342 transitions. [2019-12-27 05:41:09,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:41:09,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 05:41:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:09,094 INFO L225 Difference]: With dead ends: 24492 [2019-12-27 05:41:09,094 INFO L226 Difference]: Without dead ends: 24492 [2019-12-27 05:41:09,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:41:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24492 states. [2019-12-27 05:41:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24492 to 20516. [2019-12-27 05:41:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-27 05:41:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 62500 transitions. [2019-12-27 05:41:09,414 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 62500 transitions. Word has length 29 [2019-12-27 05:41:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:09,414 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 62500 transitions. [2019-12-27 05:41:09,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:41:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 62500 transitions. [2019-12-27 05:41:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:41:09,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:09,434 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-27 05:41:09,435 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-27 05:41:09,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:09,435 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-27 05:41:09,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:09,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473518199] [2019-12-27 05:41:09,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:09,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473518199] [2019-12-27 05:41:09,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:09,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:41:09,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861642658] [2019-12-27 05:41:09,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:41:09,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:09,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:41:09,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:41:09,548 INFO L87 Difference]: Start difference. First operand 20516 states and 62500 transitions. Second operand 6 states. [2019-12-27 05:41:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:10,295 INFO L93 Difference]: Finished difference Result 27891 states and 82809 transitions. [2019-12-27 05:41:10,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:41:10,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 05:41:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:10,332 INFO L225 Difference]: With dead ends: 27891 [2019-12-27 05:41:10,333 INFO L226 Difference]: Without dead ends: 27891 [2019-12-27 05:41:10,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:41:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27891 states. [2019-12-27 05:41:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27891 to 21560. [2019-12-27 05:41:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21560 states. [2019-12-27 05:41:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21560 states to 21560 states and 65334 transitions. [2019-12-27 05:41:10,928 INFO L78 Accepts]: Start accepts. Automaton has 21560 states and 65334 transitions. Word has length 33 [2019-12-27 05:41:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:10,929 INFO L462 AbstractCegarLoop]: Abstraction has 21560 states and 65334 transitions. [2019-12-27 05:41:10,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:41:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 21560 states and 65334 transitions. [2019-12-27 05:41:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 05:41:10,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:10,947 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] [2019-12-27 05:41:10,948 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-27 05:41:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-27 05:41:10,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:10,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968382224] [2019-12-27 05:41:10,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:11,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968382224] [2019-12-27 05:41:11,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:11,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:41:11,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438030651] [2019-12-27 05:41:11,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:41:11,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:41:11,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:41:11,062 INFO L87 Difference]: Start difference. First operand 21560 states and 65334 transitions. Second operand 6 states. [2019-12-27 05:41:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:11,803 INFO L93 Difference]: Finished difference Result 27170 states and 81035 transitions. [2019-12-27 05:41:11,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:41:11,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-27 05:41:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:11,840 INFO L225 Difference]: With dead ends: 27170 [2019-12-27 05:41:11,840 INFO L226 Difference]: Without dead ends: 27170 [2019-12-27 05:41:11,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:41:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27170 states. [2019-12-27 05:41:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27170 to 18453. [2019-12-27 05:41:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18453 states. [2019-12-27 05:41:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18453 states to 18453 states and 56474 transitions. [2019-12-27 05:41:12,173 INFO L78 Accepts]: Start accepts. Automaton has 18453 states and 56474 transitions. Word has length 35 [2019-12-27 05:41:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:12,173 INFO L462 AbstractCegarLoop]: Abstraction has 18453 states and 56474 transitions. [2019-12-27 05:41:12,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:41:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 18453 states and 56474 transitions. [2019-12-27 05:41:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:41:12,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:12,191 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-27 05:41:12,191 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-27 05:41:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:12,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-27 05:41:12,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:12,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853265459] [2019-12-27 05:41:12,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:12,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853265459] [2019-12-27 05:41:12,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:12,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:41:12,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647540712] [2019-12-27 05:41:12,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:41:12,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:12,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:41:12,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:41:12,247 INFO L87 Difference]: Start difference. First operand 18453 states and 56474 transitions. Second operand 3 states. [2019-12-27 05:41:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:12,315 INFO L93 Difference]: Finished difference Result 18452 states and 56472 transitions. [2019-12-27 05:41:12,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:41:12,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:41:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:12,348 INFO L225 Difference]: With dead ends: 18452 [2019-12-27 05:41:12,348 INFO L226 Difference]: Without dead ends: 18452 [2019-12-27 05:41:12,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:41:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18452 states. [2019-12-27 05:41:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18452 to 18452. [2019-12-27 05:41:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18452 states. [2019-12-27 05:41:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18452 states to 18452 states and 56472 transitions. [2019-12-27 05:41:12,662 INFO L78 Accepts]: Start accepts. Automaton has 18452 states and 56472 transitions. Word has length 39 [2019-12-27 05:41:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:12,662 INFO L462 AbstractCegarLoop]: Abstraction has 18452 states and 56472 transitions. [2019-12-27 05:41:12,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:41:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 18452 states and 56472 transitions. [2019-12-27 05:41:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:41:12,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:12,681 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-27 05:41:12,682 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-27 05:41:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-27 05:41:12,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:12,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859637004] [2019-12-27 05:41:12,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:12,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859637004] [2019-12-27 05:41:12,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:12,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:41:12,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181624768] [2019-12-27 05:41:12,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:41:12,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:12,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:41:12,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:12,765 INFO L87 Difference]: Start difference. First operand 18452 states and 56472 transitions. Second operand 5 states. [2019-12-27 05:41:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:13,349 INFO L93 Difference]: Finished difference Result 26475 states and 80116 transitions. [2019-12-27 05:41:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:41:13,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:41:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:13,407 INFO L225 Difference]: With dead ends: 26475 [2019-12-27 05:41:13,407 INFO L226 Difference]: Without dead ends: 26475 [2019-12-27 05:41:13,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:41:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26475 states. [2019-12-27 05:41:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26475 to 24653. [2019-12-27 05:41:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24653 states. [2019-12-27 05:41:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24653 states to 24653 states and 75114 transitions. [2019-12-27 05:41:14,184 INFO L78 Accepts]: Start accepts. Automaton has 24653 states and 75114 transitions. Word has length 40 [2019-12-27 05:41:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:14,184 INFO L462 AbstractCegarLoop]: Abstraction has 24653 states and 75114 transitions. [2019-12-27 05:41:14,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:41:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 24653 states and 75114 transitions. [2019-12-27 05:41:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:41:14,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:14,214 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-27 05:41:14,215 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-27 05:41:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:14,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-27 05:41:14,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:14,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657305667] [2019-12-27 05:41:14,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:14,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657305667] [2019-12-27 05:41:14,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:14,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:41:14,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863758013] [2019-12-27 05:41:14,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:41:14,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:41:14,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:41:14,285 INFO L87 Difference]: Start difference. First operand 24653 states and 75114 transitions. Second operand 3 states. [2019-12-27 05:41:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:14,383 INFO L93 Difference]: Finished difference Result 24653 states and 74278 transitions. [2019-12-27 05:41:14,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:41:14,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 05:41:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:14,420 INFO L225 Difference]: With dead ends: 24653 [2019-12-27 05:41:14,421 INFO L226 Difference]: Without dead ends: 24653 [2019-12-27 05:41:14,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:41:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24653 states. [2019-12-27 05:41:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24653 to 24525. [2019-12-27 05:41:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24525 states. [2019-12-27 05:41:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24525 states to 24525 states and 73922 transitions. [2019-12-27 05:41:14,783 INFO L78 Accepts]: Start accepts. Automaton has 24525 states and 73922 transitions. Word has length 40 [2019-12-27 05:41:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:14,784 INFO L462 AbstractCegarLoop]: Abstraction has 24525 states and 73922 transitions. [2019-12-27 05:41:14,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:41:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 24525 states and 73922 transitions. [2019-12-27 05:41:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:41:14,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:14,806 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] [2019-12-27 05:41:14,806 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-27 05:41:14,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1403753262, now seen corresponding path program 1 times [2019-12-27 05:41:14,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:14,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621215820] [2019-12-27 05:41:14,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:14,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621215820] [2019-12-27 05:41:14,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:14,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:41:14,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352108071] [2019-12-27 05:41:14,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:41:14,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:41:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:14,860 INFO L87 Difference]: Start difference. First operand 24525 states and 73922 transitions. Second operand 5 states. [2019-12-27 05:41:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:14,971 INFO L93 Difference]: Finished difference Result 23089 states and 70583 transitions. [2019-12-27 05:41:14,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:41:14,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 05:41:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:15,015 INFO L225 Difference]: With dead ends: 23089 [2019-12-27 05:41:15,016 INFO L226 Difference]: Without dead ends: 23089 [2019-12-27 05:41:15,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:41:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23089 states. [2019-12-27 05:41:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23089 to 22081. [2019-12-27 05:41:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22081 states. [2019-12-27 05:41:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22081 states to 22081 states and 67864 transitions. [2019-12-27 05:41:15,429 INFO L78 Accepts]: Start accepts. Automaton has 22081 states and 67864 transitions. Word has length 41 [2019-12-27 05:41:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:15,429 INFO L462 AbstractCegarLoop]: Abstraction has 22081 states and 67864 transitions. [2019-12-27 05:41:15,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:41:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 22081 states and 67864 transitions. [2019-12-27 05:41:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:41:15,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:15,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:41:15,451 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-27 05:41:15,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash 384634377, now seen corresponding path program 1 times [2019-12-27 05:41:15,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:15,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023685152] [2019-12-27 05:41:15,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:15,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023685152] [2019-12-27 05:41:15,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:15,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:41:15,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570241464] [2019-12-27 05:41:15,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:41:15,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:41:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:41:15,550 INFO L87 Difference]: Start difference. First operand 22081 states and 67864 transitions. Second operand 6 states. [2019-12-27 05:41:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:16,459 INFO L93 Difference]: Finished difference Result 29004 states and 88036 transitions. [2019-12-27 05:41:16,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 05:41:16,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 05:41:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:16,498 INFO L225 Difference]: With dead ends: 29004 [2019-12-27 05:41:16,498 INFO L226 Difference]: Without dead ends: 29004 [2019-12-27 05:41:16,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:41:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29004 states. [2019-12-27 05:41:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29004 to 23316. [2019-12-27 05:41:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23316 states. [2019-12-27 05:41:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23316 states to 23316 states and 71577 transitions. [2019-12-27 05:41:17,151 INFO L78 Accepts]: Start accepts. Automaton has 23316 states and 71577 transitions. Word has length 65 [2019-12-27 05:41:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:17,151 INFO L462 AbstractCegarLoop]: Abstraction has 23316 states and 71577 transitions. [2019-12-27 05:41:17,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:41:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 23316 states and 71577 transitions. [2019-12-27 05:41:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:41:17,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:17,177 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-27 05:41:17,177 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-27 05:41:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1572101585, now seen corresponding path program 2 times [2019-12-27 05:41:17,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:17,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792740697] [2019-12-27 05:41:17,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:17,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792740697] [2019-12-27 05:41:17,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:17,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:41:17,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467667320] [2019-12-27 05:41:17,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:41:17,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:41:17,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:41:17,236 INFO L87 Difference]: Start difference. First operand 23316 states and 71577 transitions. Second operand 3 states. [2019-12-27 05:41:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:17,378 INFO L93 Difference]: Finished difference Result 29439 states and 89258 transitions. [2019-12-27 05:41:17,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:41:17,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:41:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:17,417 INFO L225 Difference]: With dead ends: 29439 [2019-12-27 05:41:17,418 INFO L226 Difference]: Without dead ends: 29439 [2019-12-27 05:41:17,418 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-27 05:41:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29439 states. [2019-12-27 05:41:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29439 to 24569. [2019-12-27 05:41:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24569 states. [2019-12-27 05:41:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24569 states to 24569 states and 75239 transitions. [2019-12-27 05:41:17,817 INFO L78 Accepts]: Start accepts. Automaton has 24569 states and 75239 transitions. Word has length 65 [2019-12-27 05:41:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:17,817 INFO L462 AbstractCegarLoop]: Abstraction has 24569 states and 75239 transitions. [2019-12-27 05:41:17,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:41:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24569 states and 75239 transitions. [2019-12-27 05:41:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:41:17,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:17,845 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-27 05:41:17,845 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-27 05:41:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:17,846 INFO L82 PathProgramCache]: Analyzing trace with hash 158811229, now seen corresponding path program 1 times [2019-12-27 05:41:17,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:17,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628653534] [2019-12-27 05:41:17,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:18,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628653534] [2019-12-27 05:41:18,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:18,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:41:18,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812450553] [2019-12-27 05:41:18,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:41:18,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:18,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:41:18,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:41:18,015 INFO L87 Difference]: Start difference. First operand 24569 states and 75239 transitions. Second operand 10 states. [2019-12-27 05:41:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:20,624 INFO L93 Difference]: Finished difference Result 35257 states and 105630 transitions. [2019-12-27 05:41:20,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 05:41:20,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 05:41:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:20,671 INFO L225 Difference]: With dead ends: 35257 [2019-12-27 05:41:20,671 INFO L226 Difference]: Without dead ends: 35257 [2019-12-27 05:41:20,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 05:41:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35257 states. [2019-12-27 05:41:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35257 to 24504. [2019-12-27 05:41:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-27 05:41:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 74898 transitions. [2019-12-27 05:41:21,396 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 74898 transitions. Word has length 66 [2019-12-27 05:41:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:21,396 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 74898 transitions. [2019-12-27 05:41:21,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:41:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 74898 transitions. [2019-12-27 05:41:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:41:21,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:21,432 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-27 05:41:21,432 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-27 05:41:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash 27554715, now seen corresponding path program 2 times [2019-12-27 05:41:21,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:21,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655381274] [2019-12-27 05:41:21,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:21,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655381274] [2019-12-27 05:41:21,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:21,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:41:21,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622812708] [2019-12-27 05:41:21,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:41:21,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:21,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:41:21,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:41:21,501 INFO L87 Difference]: Start difference. First operand 24504 states and 74898 transitions. Second operand 3 states. [2019-12-27 05:41:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:21,590 INFO L93 Difference]: Finished difference Result 24503 states and 74896 transitions. [2019-12-27 05:41:21,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:41:21,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:41:21,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:21,624 INFO L225 Difference]: With dead ends: 24503 [2019-12-27 05:41:21,624 INFO L226 Difference]: Without dead ends: 24503 [2019-12-27 05:41:21,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:41:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24503 states. [2019-12-27 05:41:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24503 to 19681. [2019-12-27 05:41:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19681 states. [2019-12-27 05:41:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19681 states to 19681 states and 60996 transitions. [2019-12-27 05:41:21,957 INFO L78 Accepts]: Start accepts. Automaton has 19681 states and 60996 transitions. Word has length 66 [2019-12-27 05:41:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:21,958 INFO L462 AbstractCegarLoop]: Abstraction has 19681 states and 60996 transitions. [2019-12-27 05:41:21,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:41:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 19681 states and 60996 transitions. [2019-12-27 05:41:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:41:21,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:21,978 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-27 05:41:21,978 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-27 05:41:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1309527475, now seen corresponding path program 1 times [2019-12-27 05:41:21,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:21,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413416199] [2019-12-27 05:41:21,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:22,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413416199] [2019-12-27 05:41:22,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:22,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:41:22,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116363071] [2019-12-27 05:41:22,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:41:22,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:41:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:41:22,657 INFO L87 Difference]: Start difference. First operand 19681 states and 60996 transitions. Second operand 15 states. [2019-12-27 05:41:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:31,615 INFO L93 Difference]: Finished difference Result 65418 states and 199727 transitions. [2019-12-27 05:41:31,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-27 05:41:31,615 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 05:41:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:31,676 INFO L225 Difference]: With dead ends: 65418 [2019-12-27 05:41:31,676 INFO L226 Difference]: Without dead ends: 42428 [2019-12-27 05:41:31,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2237 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=937, Invalid=5705, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 05:41:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42428 states. [2019-12-27 05:41:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42428 to 22697. [2019-12-27 05:41:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22697 states. [2019-12-27 05:41:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22697 states to 22697 states and 70300 transitions. [2019-12-27 05:41:32,150 INFO L78 Accepts]: Start accepts. Automaton has 22697 states and 70300 transitions. Word has length 67 [2019-12-27 05:41:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:32,150 INFO L462 AbstractCegarLoop]: Abstraction has 22697 states and 70300 transitions. [2019-12-27 05:41:32,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:41:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 22697 states and 70300 transitions. [2019-12-27 05:41:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:41:32,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:32,175 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-27 05:41:32,175 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-27 05:41:32,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1532450363, now seen corresponding path program 2 times [2019-12-27 05:41:32,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:32,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110504823] [2019-12-27 05:41:32,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:32,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110504823] [2019-12-27 05:41:32,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:32,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 05:41:32,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880004711] [2019-12-27 05:41:32,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 05:41:32,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:32,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 05:41:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:41:32,444 INFO L87 Difference]: Start difference. First operand 22697 states and 70300 transitions. Second operand 13 states. [2019-12-27 05:41:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:35,594 INFO L93 Difference]: Finished difference Result 47474 states and 144090 transitions. [2019-12-27 05:41:35,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 05:41:35,595 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 05:41:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:35,638 INFO L225 Difference]: With dead ends: 47474 [2019-12-27 05:41:35,639 INFO L226 Difference]: Without dead ends: 31903 [2019-12-27 05:41:35,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 05:41:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31903 states. [2019-12-27 05:41:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31903 to 23887. [2019-12-27 05:41:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23887 states. [2019-12-27 05:41:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23887 states to 23887 states and 73313 transitions. [2019-12-27 05:41:36,034 INFO L78 Accepts]: Start accepts. Automaton has 23887 states and 73313 transitions. Word has length 67 [2019-12-27 05:41:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:36,035 INFO L462 AbstractCegarLoop]: Abstraction has 23887 states and 73313 transitions. [2019-12-27 05:41:36,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 05:41:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 23887 states and 73313 transitions. [2019-12-27 05:41:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:41:36,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:36,058 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-27 05:41:36,058 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-27 05:41:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2146626547, now seen corresponding path program 3 times [2019-12-27 05:41:36,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:36,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572789143] [2019-12-27 05:41:36,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:36,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572789143] [2019-12-27 05:41:36,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:36,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:41:36,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032345847] [2019-12-27 05:41:36,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 05:41:36,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:36,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 05:41:36,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:41:36,391 INFO L87 Difference]: Start difference. First operand 23887 states and 73313 transitions. Second operand 14 states. [2019-12-27 05:41:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:40,764 INFO L93 Difference]: Finished difference Result 35003 states and 106151 transitions. [2019-12-27 05:41:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 05:41:40,765 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 05:41:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:40,811 INFO L225 Difference]: With dead ends: 35003 [2019-12-27 05:41:40,811 INFO L226 Difference]: Without dead ends: 32133 [2019-12-27 05:41:40,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=425, Invalid=2331, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 05:41:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32133 states. [2019-12-27 05:41:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32133 to 25780. [2019-12-27 05:41:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25780 states. [2019-12-27 05:41:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25780 states to 25780 states and 78728 transitions. [2019-12-27 05:41:41,529 INFO L78 Accepts]: Start accepts. Automaton has 25780 states and 78728 transitions. Word has length 67 [2019-12-27 05:41:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:41,529 INFO L462 AbstractCegarLoop]: Abstraction has 25780 states and 78728 transitions. [2019-12-27 05:41:41,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 05:41:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 25780 states and 78728 transitions. [2019-12-27 05:41:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:41:41,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:41,557 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-27 05:41:41,557 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-27 05:41:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1426167887, now seen corresponding path program 4 times [2019-12-27 05:41:41,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:41,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444883195] [2019-12-27 05:41:41,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:42,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444883195] [2019-12-27 05:41:42,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:42,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 05:41:42,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183626840] [2019-12-27 05:41:42,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 05:41:42,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 05:41:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:41:42,209 INFO L87 Difference]: Start difference. First operand 25780 states and 78728 transitions. Second operand 20 states. [2019-12-27 05:41:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:52,019 INFO L93 Difference]: Finished difference Result 43469 states and 129277 transitions. [2019-12-27 05:41:52,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-12-27 05:41:52,019 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 05:41:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:52,070 INFO L225 Difference]: With dead ends: 43469 [2019-12-27 05:41:52,071 INFO L226 Difference]: Without dead ends: 37938 [2019-12-27 05:41:52,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3198 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1311, Invalid=8195, Unknown=0, NotChecked=0, Total=9506 [2019-12-27 05:41:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37938 states. [2019-12-27 05:41:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37938 to 26272. [2019-12-27 05:41:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26272 states. [2019-12-27 05:41:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26272 states to 26272 states and 80051 transitions. [2019-12-27 05:41:52,541 INFO L78 Accepts]: Start accepts. Automaton has 26272 states and 80051 transitions. Word has length 67 [2019-12-27 05:41:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:52,541 INFO L462 AbstractCegarLoop]: Abstraction has 26272 states and 80051 transitions. [2019-12-27 05:41:52,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 05:41:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 26272 states and 80051 transitions. [2019-12-27 05:41:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:41:52,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:52,571 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-27 05:41:52,571 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-27 05:41:52,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1973635833, now seen corresponding path program 5 times [2019-12-27 05:41:52,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:52,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550064918] [2019-12-27 05:41:52,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:52,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-27 05:41:52,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550064918] [2019-12-27 05:41:52,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:52,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:41:52,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692111748] [2019-12-27 05:41:52,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:41:52,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:52,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:41:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:41:52,639 INFO L87 Difference]: Start difference. First operand 26272 states and 80051 transitions. Second operand 7 states. [2019-12-27 05:41:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:53,093 INFO L93 Difference]: Finished difference Result 58235 states and 175716 transitions. [2019-12-27 05:41:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:41:53,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 05:41:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:53,155 INFO L225 Difference]: With dead ends: 58235 [2019-12-27 05:41:53,155 INFO L226 Difference]: Without dead ends: 45426 [2019-12-27 05:41:53,156 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-27 05:41:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45426 states. [2019-12-27 05:41:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45426 to 26095. [2019-12-27 05:41:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26095 states. [2019-12-27 05:41:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26095 states to 26095 states and 79187 transitions. [2019-12-27 05:41:53,682 INFO L78 Accepts]: Start accepts. Automaton has 26095 states and 79187 transitions. Word has length 67 [2019-12-27 05:41:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:53,682 INFO L462 AbstractCegarLoop]: Abstraction has 26095 states and 79187 transitions. [2019-12-27 05:41:53,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:41:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 26095 states and 79187 transitions. [2019-12-27 05:41:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:41:53,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:53,710 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-27 05:41:53,710 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-27 05:41:53,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash 776047703, now seen corresponding path program 6 times [2019-12-27 05:41:53,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:53,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351607992] [2019-12-27 05:41:53,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:53,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351607992] [2019-12-27 05:41:53,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:53,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:41:53,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055585306] [2019-12-27 05:41:53,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:41:53,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:53,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:41:53,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:41:53,940 INFO L87 Difference]: Start difference. First operand 26095 states and 79187 transitions. Second operand 12 states. [2019-12-27 05:41:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:55,990 INFO L93 Difference]: Finished difference Result 36970 states and 111034 transitions. [2019-12-27 05:41:55,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 05:41:55,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 05:41:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:56,036 INFO L225 Difference]: With dead ends: 36970 [2019-12-27 05:41:56,036 INFO L226 Difference]: Without dead ends: 32487 [2019-12-27 05:41:56,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:41:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32487 states. [2019-12-27 05:41:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32487 to 25771. [2019-12-27 05:41:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25771 states. [2019-12-27 05:41:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25771 states to 25771 states and 78285 transitions. [2019-12-27 05:41:56,480 INFO L78 Accepts]: Start accepts. Automaton has 25771 states and 78285 transitions. Word has length 67 [2019-12-27 05:41:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:41:56,480 INFO L462 AbstractCegarLoop]: Abstraction has 25771 states and 78285 transitions. [2019-12-27 05:41:56,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:41:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 25771 states and 78285 transitions. [2019-12-27 05:41:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:41:56,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:41:56,510 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-27 05:41:56,510 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:41:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:41:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash -606148943, now seen corresponding path program 7 times [2019-12-27 05:41:56,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:41:56,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648730367] [2019-12-27 05:41:56,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:41:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:41:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:41:56,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648730367] [2019-12-27 05:41:56,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:41:56,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:41:56,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077829042] [2019-12-27 05:41:56,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 05:41:56,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:41:56,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 05:41:56,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:41:56,802 INFO L87 Difference]: Start difference. First operand 25771 states and 78285 transitions. Second operand 14 states. [2019-12-27 05:41:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:41:59,864 INFO L93 Difference]: Finished difference Result 35721 states and 107509 transitions. [2019-12-27 05:41:59,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 05:41:59,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 05:41:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:41:59,908 INFO L225 Difference]: With dead ends: 35721 [2019-12-27 05:41:59,908 INFO L226 Difference]: Without dead ends: 30825 [2019-12-27 05:41:59,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1262, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 05:42:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30825 states. [2019-12-27 05:42:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30825 to 24584. [2019-12-27 05:42:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-12-27 05:42:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 74753 transitions. [2019-12-27 05:42:00,314 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 74753 transitions. Word has length 67 [2019-12-27 05:42:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:42:00,314 INFO L462 AbstractCegarLoop]: Abstraction has 24584 states and 74753 transitions. [2019-12-27 05:42:00,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 05:42:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 74753 transitions. [2019-12-27 05:42:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:42:00,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:42:00,338 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-27 05:42:00,339 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:42:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:42:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash 827902937, now seen corresponding path program 8 times [2019-12-27 05:42:00,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:42:00,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388486534] [2019-12-27 05:42:00,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:42:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:42:01,351 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 05:42:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:42:01,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388486534] [2019-12-27 05:42:01,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:42:01,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 05:42:01,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44002790] [2019-12-27 05:42:01,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 05:42:01,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:42:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 05:42:01,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:42:01,366 INFO L87 Difference]: Start difference. First operand 24584 states and 74753 transitions. Second operand 20 states. [2019-12-27 05:42:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:42:08,483 INFO L93 Difference]: Finished difference Result 31328 states and 94854 transitions. [2019-12-27 05:42:08,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-27 05:42:08,483 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 05:42:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:42:08,531 INFO L225 Difference]: With dead ends: 31328 [2019-12-27 05:42:08,531 INFO L226 Difference]: Without dead ends: 30717 [2019-12-27 05:42:08,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=668, Invalid=4162, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 05:42:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30717 states. [2019-12-27 05:42:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30717 to 24584. [2019-12-27 05:42:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-12-27 05:42:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 74738 transitions. [2019-12-27 05:42:08,944 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 74738 transitions. Word has length 67 [2019-12-27 05:42:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:42:08,945 INFO L462 AbstractCegarLoop]: Abstraction has 24584 states and 74738 transitions. [2019-12-27 05:42:08,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 05:42:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 74738 transitions. [2019-12-27 05:42:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:42:08,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:42:08,972 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-27 05:42:08,972 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:42:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:42:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1552745073, now seen corresponding path program 9 times [2019-12-27 05:42:08,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:42:08,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979418021] [2019-12-27 05:42:08,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:42:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:42:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:42:09,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979418021] [2019-12-27 05:42:09,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:42:09,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:42:09,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91219033] [2019-12-27 05:42:09,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:42:09,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:42:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:42:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:42:09,272 INFO L87 Difference]: Start difference. First operand 24584 states and 74738 transitions. Second operand 12 states. [2019-12-27 05:42:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:42:11,198 INFO L93 Difference]: Finished difference Result 47508 states and 144977 transitions. [2019-12-27 05:42:11,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 05:42:11,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 05:42:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:42:11,266 INFO L225 Difference]: With dead ends: 47508 [2019-12-27 05:42:11,266 INFO L226 Difference]: Without dead ends: 44914 [2019-12-27 05:42:11,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2019-12-27 05:42:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44914 states. [2019-12-27 05:42:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44914 to 26078. [2019-12-27 05:42:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26078 states. [2019-12-27 05:42:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26078 states to 26078 states and 79571 transitions. [2019-12-27 05:42:11,834 INFO L78 Accepts]: Start accepts. Automaton has 26078 states and 79571 transitions. Word has length 67 [2019-12-27 05:42:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:42:11,834 INFO L462 AbstractCegarLoop]: Abstraction has 26078 states and 79571 transitions. [2019-12-27 05:42:11,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:42:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 26078 states and 79571 transitions. [2019-12-27 05:42:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:42:11,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:42:11,863 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-27 05:42:11,863 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:42:11,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:42:11,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1476937065, now seen corresponding path program 10 times [2019-12-27 05:42:11,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:42:11,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478009854] [2019-12-27 05:42:11,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:42:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:42:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:42:12,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478009854] [2019-12-27 05:42:12,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:42:12,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 05:42:12,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956165407] [2019-12-27 05:42:12,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 05:42:12,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:42:12,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 05:42:12,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:42:12,560 INFO L87 Difference]: Start difference. First operand 26078 states and 79571 transitions. Second operand 17 states. [2019-12-27 05:42:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:42:16,728 INFO L93 Difference]: Finished difference Result 46741 states and 141193 transitions. [2019-12-27 05:42:16,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 05:42:16,729 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 05:42:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:42:16,792 INFO L225 Difference]: With dead ends: 46741 [2019-12-27 05:42:16,793 INFO L226 Difference]: Without dead ends: 46355 [2019-12-27 05:42:16,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=333, Invalid=1647, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 05:42:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46355 states. [2019-12-27 05:42:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46355 to 26003. [2019-12-27 05:42:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26003 states. [2019-12-27 05:42:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26003 states to 26003 states and 79398 transitions. [2019-12-27 05:42:17,513 INFO L78 Accepts]: Start accepts. Automaton has 26003 states and 79398 transitions. Word has length 67 [2019-12-27 05:42:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:42:17,513 INFO L462 AbstractCegarLoop]: Abstraction has 26003 states and 79398 transitions. [2019-12-27 05:42:17,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 05:42:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 26003 states and 79398 transitions. [2019-12-27 05:42:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:42:17,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:42:17,541 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-27 05:42:17,541 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:42:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:42:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash 358584945, now seen corresponding path program 11 times [2019-12-27 05:42:17,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:42:17,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297247649] [2019-12-27 05:42:17,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:42:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:42:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:42:17,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297247649] [2019-12-27 05:42:17,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:42:17,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:42:17,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743493177] [2019-12-27 05:42:17,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 05:42:17,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:42:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 05:42:17,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:42:17,829 INFO L87 Difference]: Start difference. First operand 26003 states and 79398 transitions. Second operand 14 states. [2019-12-27 05:42:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:42:20,938 INFO L93 Difference]: Finished difference Result 33456 states and 101574 transitions. [2019-12-27 05:42:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 05:42:20,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-27 05:42:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:42:20,983 INFO L225 Difference]: With dead ends: 33456 [2019-12-27 05:42:20,983 INFO L226 Difference]: Without dead ends: 30840 [2019-12-27 05:42:20,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=1212, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 05:42:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30840 states. [2019-12-27 05:42:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30840 to 24625. [2019-12-27 05:42:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24625 states. [2019-12-27 05:42:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24625 states to 24625 states and 75647 transitions. [2019-12-27 05:42:21,401 INFO L78 Accepts]: Start accepts. Automaton has 24625 states and 75647 transitions. Word has length 67 [2019-12-27 05:42:21,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:42:21,401 INFO L462 AbstractCegarLoop]: Abstraction has 24625 states and 75647 transitions. [2019-12-27 05:42:21,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 05:42:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24625 states and 75647 transitions. [2019-12-27 05:42:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:42:21,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:42:21,429 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-27 05:42:21,429 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:42:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:42:21,430 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 12 times [2019-12-27 05:42:21,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:42:21,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901686932] [2019-12-27 05:42:21,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:42:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:42:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:42:21,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:42:21,616 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:42:21,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~__unbuffered_p1_EAX~0_14) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t503~0.base_21|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (< 0 |v_#StackHeapBarrier_15|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t503~0.base_21| 4) |v_#length_21|) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t503~0.base_21|)) (= 0 v_~z$w_buff1_used~0_73) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_21|) |v_ULTIMATE.start_main_~#t503~0.offset_16| 0)) |v_#memory_int_19|) (= |v_ULTIMATE.start_main_~#t503~0.offset_16| 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= 0 v_~y~0_8) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t503~0.base_21| 1)) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t503~0.base=|v_ULTIMATE.start_main_~#t503~0.base_21|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_17, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~0.offset_15|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ULTIMATE.start_main_~#t503~0.offset=|v_ULTIMATE.start_main_~#t503~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_15|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t503~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t505~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t504~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t505~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t503~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t504~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:42:21,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= 1 v_~x~0_6) (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 05:42:21,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t504~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t504~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t504~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t504~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11|) |v_ULTIMATE.start_main_~#t504~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11| 1) |v_#valid_31|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t504~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t504~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:42:21,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t505~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12|) |v_ULTIMATE.start_main_~#t505~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t505~0.base_12| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t505~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t505~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_12|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t505~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t505~0.base, #length] because there is no mapped edge [2019-12-27 05:42:21,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1056641265 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1056641265| |P1Thread1of1ForFork2_#t~ite10_Out1056641265|)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1056641265 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1056641265| ~z~0_In1056641265) (or .cse0 .cse1) .cse2) (and (not .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1056641265| ~z$w_buff1~0_In1056641265) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1056641265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1056641265, ~z$w_buff1~0=~z$w_buff1~0_In1056641265, ~z~0=~z~0_In1056641265} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1056641265|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1056641265, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1056641265|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1056641265, ~z$w_buff1~0=~z$w_buff1~0_In1056641265, ~z~0=~z~0_In1056641265} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:42:21,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-241108908 256)))) (or (and (= ~z$w_buff1~0_In-241108908 |P2Thread1of1ForFork0_#t~ite24_Out-241108908|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-241108908| |P2Thread1of1ForFork0_#t~ite23_Out-241108908|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-241108908 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-241108908 256))) (= (mod ~z$w_buff0_used~0_In-241108908 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-241108908 256))))) (= ~z$w_buff1~0_In-241108908 |P2Thread1of1ForFork0_#t~ite23_Out-241108908|) (= |P2Thread1of1ForFork0_#t~ite23_Out-241108908| |P2Thread1of1ForFork0_#t~ite24_Out-241108908|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-241108908, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-241108908, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-241108908|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-241108908, ~z$w_buff1~0=~z$w_buff1~0_In-241108908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-241108908, ~weak$$choice2~0=~weak$$choice2~0_In-241108908} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-241108908, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-241108908|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-241108908, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-241108908|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-241108908, ~z$w_buff1~0=~z$w_buff1~0_In-241108908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-241108908, ~weak$$choice2~0=~weak$$choice2~0_In-241108908} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 05:42:21,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In524886884 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In524886884 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In524886884 256))) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In524886884 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite30_Out524886884| |P2Thread1of1ForFork0_#t~ite29_Out524886884|)) (.cse5 (= (mod ~weak$$choice2~0_In524886884 256) 0))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) .cse2 (or (not .cse3) .cse1) (not .cse4) .cse5 (= |P2Thread1of1ForFork0_#t~ite29_Out524886884| |P2Thread1of1ForFork0_#t~ite28_Out524886884|) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out524886884|))) (and (or (and (= |P2Thread1of1ForFork0_#t~ite29_In524886884| |P2Thread1of1ForFork0_#t~ite29_Out524886884|) (not .cse5) (= |P2Thread1of1ForFork0_#t~ite30_Out524886884| ~z$w_buff1_used~0_In524886884)) (and (or (and .cse6 .cse3) (and .cse0 .cse6) .cse4) (= ~z$w_buff1_used~0_In524886884 |P2Thread1of1ForFork0_#t~ite29_Out524886884|) .cse2 .cse5)) (= |P2Thread1of1ForFork0_#t~ite28_In524886884| |P2Thread1of1ForFork0_#t~ite28_Out524886884|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In524886884|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In524886884, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In524886884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In524886884, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In524886884, ~weak$$choice2~0=~weak$$choice2~0_In524886884, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In524886884|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out524886884|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In524886884, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In524886884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In524886884, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In524886884, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out524886884|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out524886884|, ~weak$$choice2~0=~weak$$choice2~0_In524886884} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 05:42:21,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:42:21,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 05:42:21,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1369204416 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1369204416 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out1369204416| |P2Thread1of1ForFork0_#t~ite38_Out1369204416|))) (or (and (= ~z$w_buff1~0_In1369204416 |P2Thread1of1ForFork0_#t~ite38_Out1369204416|) (not .cse0) .cse1 (not .cse2)) (and (= ~z~0_In1369204416 |P2Thread1of1ForFork0_#t~ite38_Out1369204416|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1369204416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1369204416, ~z$w_buff1~0=~z$w_buff1~0_In1369204416, ~z~0=~z~0_In1369204416} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1369204416|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1369204416|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1369204416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1369204416, ~z$w_buff1~0=~z$w_buff1~0_In1369204416, ~z~0=~z~0_In1369204416} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:42:21,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In388891402 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In388891402 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out388891402| ~z$w_buff0_used~0_In388891402) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out388891402|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In388891402, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388891402} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In388891402, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out388891402|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388891402} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:42:21,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In119660047 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In119660047 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In119660047 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In119660047 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out119660047| ~z$w_buff1_used~0_In119660047) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out119660047|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In119660047, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In119660047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In119660047, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In119660047} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In119660047, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In119660047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In119660047, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In119660047, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out119660047|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:42:21,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1552593398 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1552593398 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1552593398| ~z$r_buff0_thd3~0_In-1552593398) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1552593398| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1552593398, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1552593398} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1552593398, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1552593398, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1552593398|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:42:21,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-692216665 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-692216665 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-692216665 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-692216665 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-692216665|)) (and (= ~z$r_buff1_thd3~0_In-692216665 |P2Thread1of1ForFork0_#t~ite43_Out-692216665|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-692216665, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-692216665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-692216665, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-692216665} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-692216665|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-692216665, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-692216665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-692216665, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-692216665} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:42:21,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:42:21,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-708357099 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-708357099 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-708357099 |P0Thread1of1ForFork1_#t~ite5_Out-708357099|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-708357099|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-708357099, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-708357099} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-708357099|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-708357099, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-708357099} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:42:21,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1751636263 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1751636263 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1751636263 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-1751636263 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1751636263| ~z$w_buff1_used~0_In-1751636263)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1751636263| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751636263, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1751636263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1751636263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1751636263} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751636263, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1751636263|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1751636263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1751636263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1751636263} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:42:21,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1559937953 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1559937953 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-1559937953)) (and (= ~z$r_buff0_thd1~0_In-1559937953 ~z$r_buff0_thd1~0_Out-1559937953) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1559937953, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1559937953} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1559937953, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1559937953|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1559937953} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:42:21,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-737982094 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-737982094 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-737982094 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-737982094 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-737982094|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In-737982094 |P0Thread1of1ForFork1_#t~ite8_Out-737982094|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-737982094, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-737982094, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-737982094, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-737982094} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-737982094|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-737982094, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-737982094, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-737982094, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-737982094} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:42:21,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:42:21,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1870800339 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1870800339 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1870800339 |P1Thread1of1ForFork2_#t~ite11_Out-1870800339|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1870800339|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1870800339, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1870800339} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1870800339, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1870800339|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1870800339} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:42:21,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1119017421 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1119017421 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1119017421 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1119017421 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1119017421| ~z$w_buff1_used~0_In-1119017421) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1119017421| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1119017421, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1119017421, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1119017421, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1119017421} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1119017421, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1119017421, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1119017421, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1119017421|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1119017421} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:42:21,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1506355036 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1506355036 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1506355036| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-1506355036 |P1Thread1of1ForFork2_#t~ite13_Out-1506355036|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1506355036, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1506355036} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1506355036, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1506355036|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1506355036} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:42:21,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-252641361 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-252641361 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-252641361 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-252641361 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-252641361| ~z$r_buff1_thd2~0_In-252641361) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-252641361| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-252641361, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-252641361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-252641361, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-252641361} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-252641361, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-252641361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-252641361, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-252641361|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-252641361} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:42:21,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:42:21,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:42:21,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-54725143 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-54725143 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-54725143 |ULTIMATE.start_main_#t~ite47_Out-54725143|)) (and (or .cse0 .cse1) (= ~z~0_In-54725143 |ULTIMATE.start_main_#t~ite47_Out-54725143|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-54725143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-54725143, ~z$w_buff1~0=~z$w_buff1~0_In-54725143, ~z~0=~z~0_In-54725143} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-54725143, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-54725143|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-54725143, ~z$w_buff1~0=~z$w_buff1~0_In-54725143, ~z~0=~z~0_In-54725143} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:42:21,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 05:42:21,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2016356723 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2016356723 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2016356723 |ULTIMATE.start_main_#t~ite49_Out2016356723|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out2016356723|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2016356723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2016356723} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2016356723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2016356723, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out2016356723|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:42:21,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-880366938 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-880366938 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-880366938 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-880366938 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-880366938| ~z$w_buff1_used~0_In-880366938)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-880366938| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-880366938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-880366938, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-880366938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-880366938} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-880366938|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-880366938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-880366938, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-880366938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-880366938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:42:21,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-198469842 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-198469842 256)))) (or (and (= ~z$r_buff0_thd0~0_In-198469842 |ULTIMATE.start_main_#t~ite51_Out-198469842|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-198469842| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-198469842, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-198469842} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-198469842, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-198469842|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-198469842} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:42:21,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2044250465 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2044250465 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2044250465 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2044250465 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out2044250465| ~z$r_buff1_thd0~0_In2044250465) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out2044250465| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2044250465, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2044250465, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2044250465, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2044250465} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2044250465|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2044250465, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2044250465, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2044250465, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2044250465} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:42:21,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_10 2) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:42:21,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:42:21 BasicIcfg [2019-12-27 05:42:21,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:42:21,786 INFO L168 Benchmark]: Toolchain (without parser) took 151498.15 ms. Allocated memory was 146.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 05:42:21,786 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 05:42:21,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.16 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 156.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:42:21,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.27 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:42:21,790 INFO L168 Benchmark]: Boogie Preprocessor took 57.94 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:42:21,790 INFO L168 Benchmark]: RCFGBuilder took 842.45 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 100.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:42:21,791 INFO L168 Benchmark]: TraceAbstraction took 149670.29 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 05:42:21,794 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.17 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.16 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 156.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 110.27 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.94 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.45 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 100.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 149670.29 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6457 VarBasedMoverChecksPositive, 198 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t503, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t504, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t505, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 149.3s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 70.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8554 SDtfs, 11633 SDslu, 37076 SDs, 0 SdLazy, 40568 SolverSat, 692 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 725 GetRequests, 55 SyntacticMatches, 35 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9237 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred 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: 46.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 256070 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1522 NumberOfCodeBlocks, 1522 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1422 ConstructedInterpolants, 0 QuantifiedInterpolants, 523502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...