/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/safe021_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:46:59,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:46:59,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:46:59,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:46:59,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:46:59,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:46:59,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:46:59,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:46:59,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:46:59,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:46:59,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:46:59,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:46:59,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:46:59,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:46:59,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:46:59,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:46:59,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:46:59,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:46:59,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:46:59,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:46:59,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:46:59,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:46:59,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:46:59,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:46:59,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:46:59,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:46:59,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:46:59,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:46:59,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:46:59,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:46:59,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:46:59,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:46:59,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:46:59,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:46:59,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:46:59,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:46:59,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:46:59,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:46:59,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:46:59,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:46:59,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:46:59,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:46:59,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:46:59,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:46:59,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:46:59,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:46:59,300 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:46:59,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:46:59,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:46:59,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:46:59,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:46:59,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:46:59,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:46:59,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:46:59,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:46:59,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:46:59,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:46:59,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:46:59,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:46:59,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:46:59,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:46:59,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:46:59,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:46:59,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:46:59,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:46:59,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:46:59,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:46:59,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:46:59,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:46:59,305 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:46:59,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:46:59,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:46:59,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:46:59,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:46:59,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:46:59,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:46:59,637 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:46:59,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-18 22:46:59,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/485eccfe4/3c53338bdd014fc6b96a98acab9c37ea/FLAGaf2e94c2d [2019-12-18 22:47:00,188 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:47:00,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-18 22:47:00,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/485eccfe4/3c53338bdd014fc6b96a98acab9c37ea/FLAGaf2e94c2d [2019-12-18 22:47:00,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/485eccfe4/3c53338bdd014fc6b96a98acab9c37ea [2019-12-18 22:47:00,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:47:00,547 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:47:00,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:47:00,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:47:00,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:47:00,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:47:00" (1/1) ... [2019-12-18 22:47:00,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:00, skipping insertion in model container [2019-12-18 22:47:00,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:47:00" (1/1) ... [2019-12-18 22:47:00,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:47:00,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:47:01,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:47:01,255 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:47:01,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:47:01,429 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:47:01,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01 WrapperNode [2019-12-18 22:47:01,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:47:01,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:47:01,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:47:01,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:47:01,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... [2019-12-18 22:47:01,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... [2019-12-18 22:47:01,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:47:01,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:47:01,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:47:01,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:47:01,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... [2019-12-18 22:47:01,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... [2019-12-18 22:47:01,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... [2019-12-18 22:47:01,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... [2019-12-18 22:47:01,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... [2019-12-18 22:47:01,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... [2019-12-18 22:47:01,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... [2019-12-18 22:47:01,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:47:01,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:47:01,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:47:01,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:47:01,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:47:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:47:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:47:01,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:47:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:47:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:47:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:47:01,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:47:01,640 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:47:02,407 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:47:02,408 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:47:02,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:47:02 BoogieIcfgContainer [2019-12-18 22:47:02,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:47:02,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:47:02,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:47:02,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:47:02,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:47:00" (1/3) ... [2019-12-18 22:47:02,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1118bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:47:02, skipping insertion in model container [2019-12-18 22:47:02,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:47:01" (2/3) ... [2019-12-18 22:47:02,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1118bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:47:02, skipping insertion in model container [2019-12-18 22:47:02,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:47:02" (3/3) ... [2019-12-18 22:47:02,418 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_pso.oepc.i [2019-12-18 22:47:02,429 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:47:02,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:47:02,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:47:02,438 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:47:02,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,482 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,482 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,482 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,500 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,500 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,560 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,561 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,567 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:47:02,597 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:47:02,616 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:47:02,617 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:47:02,617 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:47:02,617 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:47:02,617 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:47:02,617 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:47:02,617 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:47:02,617 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:47:02,636 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 22:47:02,638 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:47:02,727 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:47:02,727 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:47:02,747 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:47:02,777 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:47:02,873 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:47:02,874 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:47:02,884 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:47:02,908 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 22:47:02,910 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:47:06,592 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:47:06,708 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:47:06,729 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-18 22:47:06,729 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 22:47:06,732 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-18 22:47:22,676 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-18 22:47:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-18 22:47:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:47:22,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:47:22,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:47:22,684 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:47:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:47:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-18 22:47:22,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:47:22,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845934822] [2019-12-18 22:47:22,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:47:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:47:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:47:22,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845934822] [2019-12-18 22:47:22,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:47:22,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:47:22,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144969032] [2019-12-18 22:47:22,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:47:22,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:47:22,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:47:22,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:47:22,978 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-18 22:47:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:47:26,346 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-18 22:47:26,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:47:26,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:47:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:47:27,172 INFO L225 Difference]: With dead ends: 106230 [2019-12-18 22:47:27,174 INFO L226 Difference]: Without dead ends: 99639 [2019-12-18 22:47:27,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:47:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-18 22:47:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-18 22:47:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-18 22:47:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-18 22:47:36,107 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-18 22:47:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:47:36,108 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-18 22:47:36,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:47:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-18 22:47:36,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:47:36,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:47:36,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:47:36,113 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:47:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:47:36,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-18 22:47:36,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:47:36,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627990316] [2019-12-18 22:47:36,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:47:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:47:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:47:36,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627990316] [2019-12-18 22:47:36,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:47:36,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:47:36,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645194571] [2019-12-18 22:47:36,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:47:36,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:47:36,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:47:36,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:47:36,260 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-18 22:47:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:47:40,599 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-18 22:47:40,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:47:40,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:47:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:47:41,724 INFO L225 Difference]: With dead ends: 159197 [2019-12-18 22:47:41,724 INFO L226 Difference]: Without dead ends: 159148 [2019-12-18 22:47:41,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:47:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-18 22:47:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-18 22:47:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-18 22:47:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-18 22:47:53,348 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-18 22:47:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:47:53,348 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-18 22:47:53,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:47:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-18 22:47:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:47:53,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:47:53,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:47:53,354 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:47:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:47:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-18 22:47:53,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:47:53,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918501133] [2019-12-18 22:47:53,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:47:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:47:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:47:53,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918501133] [2019-12-18 22:47:53,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:47:53,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:47:53,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814991755] [2019-12-18 22:47:53,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:47:53,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:47:53,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:47:53,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:47:53,420 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-18 22:47:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:47:53,539 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-18 22:47:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:47:53,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:47:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:47:53,609 INFO L225 Difference]: With dead ends: 32092 [2019-12-18 22:47:53,609 INFO L226 Difference]: Without dead ends: 32092 [2019-12-18 22:47:53,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:47:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-18 22:47:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-18 22:47:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-18 22:47:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-18 22:47:58,886 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-18 22:47:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:47:58,887 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-18 22:47:58,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:47:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-18 22:47:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 22:47:58,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:47:58,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:47:58,890 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:47:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:47:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-18 22:47:58,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:47:58,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122526025] [2019-12-18 22:47:58,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:47:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:47:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:47:59,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122526025] [2019-12-18 22:47:59,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:47:59,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:47:59,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509890634] [2019-12-18 22:47:59,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:47:59,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:47:59,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:47:59,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:47:59,101 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-18 22:47:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:47:59,648 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-18 22:47:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:47:59,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 22:47:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:47:59,715 INFO L225 Difference]: With dead ends: 43827 [2019-12-18 22:47:59,715 INFO L226 Difference]: Without dead ends: 43827 [2019-12-18 22:47:59,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:47:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-18 22:48:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-18 22:48:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-18 22:48:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-18 22:48:00,392 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-18 22:48:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:00,393 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-18 22:48:00,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-18 22:48:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:48:00,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:00,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:00,403 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:00,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:00,403 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-18 22:48:00,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:00,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857371268] [2019-12-18 22:48:00,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:00,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857371268] [2019-12-18 22:48:00,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:00,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:00,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793750123] [2019-12-18 22:48:00,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:48:00,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:00,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:48:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:48:00,533 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-18 22:48:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:01,771 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-18 22:48:01,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:48:01,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 22:48:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:01,864 INFO L225 Difference]: With dead ends: 56855 [2019-12-18 22:48:01,864 INFO L226 Difference]: Without dead ends: 56848 [2019-12-18 22:48:01,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:48:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-18 22:48:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-18 22:48:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-18 22:48:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-18 22:48:02,647 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-18 22:48:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:02,648 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-18 22:48:02,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:48:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-18 22:48:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:48:02,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:02,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:02,663 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-18 22:48:02,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:02,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159124489] [2019-12-18 22:48:02,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:02,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159124489] [2019-12-18 22:48:02,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:02,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:48:02,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479101161] [2019-12-18 22:48:02,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:48:02,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:02,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:48:02,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:02,720 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-18 22:48:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:02,785 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-18 22:48:02,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:48:02,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:48:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:02,808 INFO L225 Difference]: With dead ends: 15569 [2019-12-18 22:48:02,808 INFO L226 Difference]: Without dead ends: 15569 [2019-12-18 22:48:02,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:02,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-18 22:48:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-18 22:48:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-18 22:48:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-18 22:48:03,288 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-18 22:48:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:03,288 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-18 22:48:03,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-18 22:48:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:48:03,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:03,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:03,300 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:03,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:03,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-18 22:48:03,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:03,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893253839] [2019-12-18 22:48:03,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:03,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893253839] [2019-12-18 22:48:03,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:03,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:03,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241368400] [2019-12-18 22:48:03,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:48:03,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:48:03,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:48:03,406 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-18 22:48:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:04,025 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-18 22:48:04,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:48:04,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 22:48:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:04,066 INFO L225 Difference]: With dead ends: 21967 [2019-12-18 22:48:04,066 INFO L226 Difference]: Without dead ends: 21967 [2019-12-18 22:48:04,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:48:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-18 22:48:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-18 22:48:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-18 22:48:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-18 22:48:04,451 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-18 22:48:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:04,451 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-18 22:48:04,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:48:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-18 22:48:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 22:48:04,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:04,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:04,472 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:04,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:04,472 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-18 22:48:04,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:04,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509923070] [2019-12-18 22:48:04,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:04,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509923070] [2019-12-18 22:48:04,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:04,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:48:04,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030821398] [2019-12-18 22:48:04,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:04,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:04,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:04,622 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-18 22:48:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:05,901 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-18 22:48:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:48:05,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 22:48:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:05,935 INFO L225 Difference]: With dead ends: 24877 [2019-12-18 22:48:05,935 INFO L226 Difference]: Without dead ends: 24877 [2019-12-18 22:48:05,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:48:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-18 22:48:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-18 22:48:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-18 22:48:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-18 22:48:06,224 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-18 22:48:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:06,225 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-18 22:48:06,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-18 22:48:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:48:06,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:06,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:06,247 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:06,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-18 22:48:06,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:06,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470584533] [2019-12-18 22:48:06,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:06,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470584533] [2019-12-18 22:48:06,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:06,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:48:06,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737617135] [2019-12-18 22:48:06,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:06,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:06,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:06,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:06,307 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 3 states. [2019-12-18 22:48:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:06,485 INFO L93 Difference]: Finished difference Result 16953 states and 50980 transitions. [2019-12-18 22:48:06,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:06,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 22:48:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:06,514 INFO L225 Difference]: With dead ends: 16953 [2019-12-18 22:48:06,515 INFO L226 Difference]: Without dead ends: 16953 [2019-12-18 22:48:06,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2019-12-18 22:48:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16953. [2019-12-18 22:48:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16953 states. [2019-12-18 22:48:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16953 states to 16953 states and 50980 transitions. [2019-12-18 22:48:06,746 INFO L78 Accepts]: Start accepts. Automaton has 16953 states and 50980 transitions. Word has length 39 [2019-12-18 22:48:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:06,746 INFO L462 AbstractCegarLoop]: Abstraction has 16953 states and 50980 transitions. [2019-12-18 22:48:06,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 16953 states and 50980 transitions. [2019-12-18 22:48:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:48:06,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:06,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:06,767 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1842516343, now seen corresponding path program 1 times [2019-12-18 22:48:06,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:06,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558885734] [2019-12-18 22:48:06,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:06,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-18 22:48:06,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558885734] [2019-12-18 22:48:06,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:06,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:06,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214452745] [2019-12-18 22:48:06,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:48:06,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:06,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:48:06,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:06,829 INFO L87 Difference]: Start difference. First operand 16953 states and 50980 transitions. Second operand 4 states. [2019-12-18 22:48:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:06,973 INFO L93 Difference]: Finished difference Result 32065 states and 96487 transitions. [2019-12-18 22:48:06,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:48:06,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 22:48:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:07,007 INFO L225 Difference]: With dead ends: 32065 [2019-12-18 22:48:07,008 INFO L226 Difference]: Without dead ends: 16605 [2019-12-18 22:48:07,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2019-12-18 22:48:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16603. [2019-12-18 22:48:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16603 states. [2019-12-18 22:48:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16603 states to 16603 states and 49251 transitions. [2019-12-18 22:48:07,331 INFO L78 Accepts]: Start accepts. Automaton has 16603 states and 49251 transitions. Word has length 40 [2019-12-18 22:48:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:07,331 INFO L462 AbstractCegarLoop]: Abstraction has 16603 states and 49251 transitions. [2019-12-18 22:48:07,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 16603 states and 49251 transitions. [2019-12-18 22:48:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:48:07,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:07,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:07,349 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash 559678541, now seen corresponding path program 2 times [2019-12-18 22:48:07,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:07,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062022074] [2019-12-18 22:48:07,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:07,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062022074] [2019-12-18 22:48:07,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:07,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:48:07,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240067122] [2019-12-18 22:48:07,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:07,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:07,434 INFO L87 Difference]: Start difference. First operand 16603 states and 49251 transitions. Second operand 5 states. [2019-12-18 22:48:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:08,093 INFO L93 Difference]: Finished difference Result 22916 states and 67717 transitions. [2019-12-18 22:48:08,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:48:08,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 22:48:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:08,128 INFO L225 Difference]: With dead ends: 22916 [2019-12-18 22:48:08,128 INFO L226 Difference]: Without dead ends: 22916 [2019-12-18 22:48:08,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:48:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22916 states. [2019-12-18 22:48:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22916 to 21410. [2019-12-18 22:48:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-18 22:48:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 63610 transitions. [2019-12-18 22:48:08,452 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 63610 transitions. Word has length 40 [2019-12-18 22:48:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:08,453 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 63610 transitions. [2019-12-18 22:48:08,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 63610 transitions. [2019-12-18 22:48:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:48:08,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:08,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:08,472 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:08,472 INFO L82 PathProgramCache]: Analyzing trace with hash 698759109, now seen corresponding path program 3 times [2019-12-18 22:48:08,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:08,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266139178] [2019-12-18 22:48:08,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:08,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266139178] [2019-12-18 22:48:08,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:08,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:08,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918604899] [2019-12-18 22:48:08,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:08,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:08,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:08,560 INFO L87 Difference]: Start difference. First operand 21410 states and 63610 transitions. Second operand 5 states. [2019-12-18 22:48:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:08,655 INFO L93 Difference]: Finished difference Result 20165 states and 60739 transitions. [2019-12-18 22:48:08,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:48:08,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 22:48:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:08,696 INFO L225 Difference]: With dead ends: 20165 [2019-12-18 22:48:08,696 INFO L226 Difference]: Without dead ends: 19671 [2019-12-18 22:48:08,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2019-12-18 22:48:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 18831. [2019-12-18 22:48:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18831 states. [2019-12-18 22:48:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 57508 transitions. [2019-12-18 22:48:09,225 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 57508 transitions. Word has length 40 [2019-12-18 22:48:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:09,226 INFO L462 AbstractCegarLoop]: Abstraction has 18831 states and 57508 transitions. [2019-12-18 22:48:09,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 57508 transitions. [2019-12-18 22:48:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:09,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:09,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:09,249 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -19391093, now seen corresponding path program 1 times [2019-12-18 22:48:09,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:09,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235289084] [2019-12-18 22:48:09,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:09,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235289084] [2019-12-18 22:48:09,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:09,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:48:09,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682960309] [2019-12-18 22:48:09,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:09,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:09,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:09,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:09,294 INFO L87 Difference]: Start difference. First operand 18831 states and 57508 transitions. Second operand 3 states. [2019-12-18 22:48:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:09,449 INFO L93 Difference]: Finished difference Result 27792 states and 85045 transitions. [2019-12-18 22:48:09,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:09,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 22:48:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:09,503 INFO L225 Difference]: With dead ends: 27792 [2019-12-18 22:48:09,504 INFO L226 Difference]: Without dead ends: 27792 [2019-12-18 22:48:09,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27792 states. [2019-12-18 22:48:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27792 to 21217. [2019-12-18 22:48:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-18 22:48:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-18 22:48:09,880 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-18 22:48:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:09,880 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-18 22:48:09,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-18 22:48:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:09,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:09,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:09,910 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 1 times [2019-12-18 22:48:09,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:09,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18922900] [2019-12-18 22:48:09,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:09,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18922900] [2019-12-18 22:48:09,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:09,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:09,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950045286] [2019-12-18 22:48:09,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:09,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:09,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:09,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:09,994 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 7 states. [2019-12-18 22:48:10,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:10,487 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-18 22:48:10,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:48:10,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 22:48:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:10,547 INFO L225 Difference]: With dead ends: 62594 [2019-12-18 22:48:10,547 INFO L226 Difference]: Without dead ends: 42982 [2019-12-18 22:48:10,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:48:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-18 22:48:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-18 22:48:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-18 22:48:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-18 22:48:11,256 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-18 22:48:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:11,256 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-18 22:48:11,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-18 22:48:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:11,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:11,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:11,284 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 2 times [2019-12-18 22:48:11,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:11,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226917299] [2019-12-18 22:48:11,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:11,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226917299] [2019-12-18 22:48:11,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:11,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:11,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508686847] [2019-12-18 22:48:11,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:11,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:11,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:11,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:11,372 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 7 states. [2019-12-18 22:48:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:12,033 INFO L93 Difference]: Finished difference Result 70069 states and 215496 transitions. [2019-12-18 22:48:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:48:12,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 22:48:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:12,151 INFO L225 Difference]: With dead ends: 70069 [2019-12-18 22:48:12,152 INFO L226 Difference]: Without dead ends: 52756 [2019-12-18 22:48:12,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:48:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52756 states. [2019-12-18 22:48:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52756 to 28331. [2019-12-18 22:48:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-18 22:48:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-18 22:48:12,809 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-18 22:48:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:12,809 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-18 22:48:12,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-18 22:48:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:12,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:12,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:12,845 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 3 times [2019-12-18 22:48:12,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:12,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540791800] [2019-12-18 22:48:12,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:12,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540791800] [2019-12-18 22:48:12,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:12,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:12,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937965769] [2019-12-18 22:48:12,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:12,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:12,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:12,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:12,927 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 7 states. [2019-12-18 22:48:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:13,668 INFO L93 Difference]: Finished difference Result 60139 states and 184623 transitions. [2019-12-18 22:48:13,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:48:13,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 22:48:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:13,744 INFO L225 Difference]: With dead ends: 60139 [2019-12-18 22:48:13,745 INFO L226 Difference]: Without dead ends: 52780 [2019-12-18 22:48:13,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:48:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52780 states. [2019-12-18 22:48:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52780 to 28639. [2019-12-18 22:48:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-18 22:48:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-18 22:48:14,353 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-18 22:48:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:14,354 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-18 22:48:14,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-18 22:48:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:48:14,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:14,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:14,387 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 4 times [2019-12-18 22:48:14,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:14,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227628377] [2019-12-18 22:48:14,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:14,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227628377] [2019-12-18 22:48:14,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:14,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:14,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292795430] [2019-12-18 22:48:14,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:14,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:14,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:14,461 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-18 22:48:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:14,620 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-18 22:48:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:14,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 22:48:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:14,671 INFO L225 Difference]: With dead ends: 34404 [2019-12-18 22:48:14,672 INFO L226 Difference]: Without dead ends: 34404 [2019-12-18 22:48:14,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-18 22:48:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-18 22:48:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-18 22:48:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-18 22:48:15,231 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-18 22:48:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:15,231 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-18 22:48:15,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-18 22:48:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:15,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:15,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:15,271 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-18 22:48:15,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:15,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480710450] [2019-12-18 22:48:15,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:15,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480710450] [2019-12-18 22:48:15,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:15,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:15,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979485609] [2019-12-18 22:48:15,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:48:15,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:15,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:48:15,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:15,329 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-18 22:48:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:15,754 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-18 22:48:15,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:48:15,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 22:48:15,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:15,811 INFO L225 Difference]: With dead ends: 38058 [2019-12-18 22:48:15,811 INFO L226 Difference]: Without dead ends: 38058 [2019-12-18 22:48:15,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-18 22:48:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-18 22:48:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-18 22:48:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-18 22:48:16,359 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-18 22:48:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:16,359 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-18 22:48:16,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-18 22:48:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:16,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:16,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:16,392 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:16,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:16,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-18 22:48:16,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:16,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758377529] [2019-12-18 22:48:16,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:16,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758377529] [2019-12-18 22:48:16,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:16,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:48:16,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041769146] [2019-12-18 22:48:16,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:48:16,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:16,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:48:16,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:48:16,447 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-18 22:48:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:16,979 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-18 22:48:16,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:48:16,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 22:48:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:17,105 INFO L225 Difference]: With dead ends: 48141 [2019-12-18 22:48:17,105 INFO L226 Difference]: Without dead ends: 48141 [2019-12-18 22:48:17,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-18 22:48:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-18 22:48:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-18 22:48:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-18 22:48:17,986 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-18 22:48:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:17,986 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-18 22:48:17,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:48:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-18 22:48:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:18,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:18,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:18,353 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-18 22:48:18,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:18,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414717575] [2019-12-18 22:48:18,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:18,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414717575] [2019-12-18 22:48:18,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:18,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:48:18,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569684087] [2019-12-18 22:48:18,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:18,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:18,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:18,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:18,442 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-18 22:48:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:18,957 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-18 22:48:18,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:48:18,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:48:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:19,063 INFO L225 Difference]: With dead ends: 72421 [2019-12-18 22:48:19,063 INFO L226 Difference]: Without dead ends: 66202 [2019-12-18 22:48:19,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:48:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-18 22:48:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-18 22:48:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-18 22:48:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-18 22:48:19,839 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-18 22:48:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:19,840 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-18 22:48:19,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-18 22:48:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:19,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:19,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:19,878 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-18 22:48:19,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:19,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519569947] [2019-12-18 22:48:19,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:19,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519569947] [2019-12-18 22:48:19,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:19,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:48:19,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253528999] [2019-12-18 22:48:19,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:48:19,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:48:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:19,987 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 7 states. [2019-12-18 22:48:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:20,797 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-18 22:48:20,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:48:20,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:48:20,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:20,884 INFO L225 Difference]: With dead ends: 53845 [2019-12-18 22:48:20,885 INFO L226 Difference]: Without dead ends: 53845 [2019-12-18 22:48:20,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:48:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-18 22:48:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-18 22:48:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-18 22:48:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-18 22:48:21,830 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-18 22:48:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:21,831 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-18 22:48:21,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:48:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-18 22:48:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:21,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:21,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:21,880 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:21,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-18 22:48:21,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:21,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987363521] [2019-12-18 22:48:21,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:21,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987363521] [2019-12-18 22:48:21,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:21,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:48:21,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012195945] [2019-12-18 22:48:21,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:48:21,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:48:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:48:21,957 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-18 22:48:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:22,625 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-18 22:48:22,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:48:22,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:48:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:22,717 INFO L225 Difference]: With dead ends: 49777 [2019-12-18 22:48:22,718 INFO L226 Difference]: Without dead ends: 49557 [2019-12-18 22:48:22,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:48:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-18 22:48:23,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-18 22:48:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-18 22:48:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-18 22:48:23,404 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-18 22:48:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:23,405 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-18 22:48:23,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:48:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-18 22:48:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:23,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:23,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-18 22:48:23,451 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-18 22:48:23,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:23,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343570945] [2019-12-18 22:48:23,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:23,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343570945] [2019-12-18 22:48:23,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:23,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:48:23,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077609809] [2019-12-18 22:48:23,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:48:23,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:23,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:48:23,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:48:23,627 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 9 states. [2019-12-18 22:48:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:25,446 INFO L93 Difference]: Finished difference Result 59625 states and 183241 transitions. [2019-12-18 22:48:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:48:25,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 22:48:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:25,542 INFO L225 Difference]: With dead ends: 59625 [2019-12-18 22:48:25,543 INFO L226 Difference]: Without dead ends: 59513 [2019-12-18 22:48:25,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:48:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59513 states. [2019-12-18 22:48:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59513 to 40852. [2019-12-18 22:48:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40852 states. [2019-12-18 22:48:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40852 states to 40852 states and 127127 transitions. [2019-12-18 22:48:26,300 INFO L78 Accepts]: Start accepts. Automaton has 40852 states and 127127 transitions. Word has length 65 [2019-12-18 22:48:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:26,300 INFO L462 AbstractCegarLoop]: Abstraction has 40852 states and 127127 transitions. [2019-12-18 22:48:26,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:48:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 40852 states and 127127 transitions. [2019-12-18 22:48:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:26,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:26,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:26,349 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:26,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-18 22:48:26,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:26,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404871933] [2019-12-18 22:48:26,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:26,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404871933] [2019-12-18 22:48:26,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:26,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:48:26,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015849756] [2019-12-18 22:48:26,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:48:26,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:26,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:48:26,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:48:26,563 INFO L87 Difference]: Start difference. First operand 40852 states and 127127 transitions. Second operand 13 states. [2019-12-18 22:48:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:29,937 INFO L93 Difference]: Finished difference Result 62465 states and 190835 transitions. [2019-12-18 22:48:29,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:48:29,937 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-18 22:48:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:30,034 INFO L225 Difference]: With dead ends: 62465 [2019-12-18 22:48:30,035 INFO L226 Difference]: Without dead ends: 62169 [2019-12-18 22:48:30,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=951, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 22:48:30,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62169 states. [2019-12-18 22:48:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62169 to 44129. [2019-12-18 22:48:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44129 states. [2019-12-18 22:48:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44129 states to 44129 states and 136879 transitions. [2019-12-18 22:48:30,879 INFO L78 Accepts]: Start accepts. Automaton has 44129 states and 136879 transitions. Word has length 65 [2019-12-18 22:48:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:30,879 INFO L462 AbstractCegarLoop]: Abstraction has 44129 states and 136879 transitions. [2019-12-18 22:48:30,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:48:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 44129 states and 136879 transitions. [2019-12-18 22:48:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:48:30,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:30,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:30,932 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-18 22:48:30,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:30,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909205823] [2019-12-18 22:48:30,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:31,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909205823] [2019-12-18 22:48:31,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:31,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:31,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361962908] [2019-12-18 22:48:31,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:31,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:31,003 INFO L87 Difference]: Start difference. First operand 44129 states and 136879 transitions. Second operand 3 states. [2019-12-18 22:48:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:31,154 INFO L93 Difference]: Finished difference Result 44129 states and 136878 transitions. [2019-12-18 22:48:31,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:31,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:48:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:31,227 INFO L225 Difference]: With dead ends: 44129 [2019-12-18 22:48:31,227 INFO L226 Difference]: Without dead ends: 44129 [2019-12-18 22:48:31,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44129 states. [2019-12-18 22:48:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44129 to 37314. [2019-12-18 22:48:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37314 states. [2019-12-18 22:48:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37314 states to 37314 states and 117566 transitions. [2019-12-18 22:48:32,164 INFO L78 Accepts]: Start accepts. Automaton has 37314 states and 117566 transitions. Word has length 65 [2019-12-18 22:48:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:32,164 INFO L462 AbstractCegarLoop]: Abstraction has 37314 states and 117566 transitions. [2019-12-18 22:48:32,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 37314 states and 117566 transitions. [2019-12-18 22:48:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:48:32,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:32,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:32,207 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1323575748, now seen corresponding path program 1 times [2019-12-18 22:48:32,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:32,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220654448] [2019-12-18 22:48:32,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:32,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220654448] [2019-12-18 22:48:32,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:32,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:48:32,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178624819] [2019-12-18 22:48:32,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:48:32,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:32,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:48:32,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:48:32,418 INFO L87 Difference]: Start difference. First operand 37314 states and 117566 transitions. Second operand 11 states. [2019-12-18 22:48:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:34,501 INFO L93 Difference]: Finished difference Result 59226 states and 182880 transitions. [2019-12-18 22:48:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:48:34,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 22:48:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:34,603 INFO L225 Difference]: With dead ends: 59226 [2019-12-18 22:48:34,604 INFO L226 Difference]: Without dead ends: 59226 [2019-12-18 22:48:34,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:48:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59226 states. [2019-12-18 22:48:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59226 to 39255. [2019-12-18 22:48:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39255 states. [2019-12-18 22:48:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39255 states to 39255 states and 124025 transitions. [2019-12-18 22:48:35,436 INFO L78 Accepts]: Start accepts. Automaton has 39255 states and 124025 transitions. Word has length 66 [2019-12-18 22:48:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:35,436 INFO L462 AbstractCegarLoop]: Abstraction has 39255 states and 124025 transitions. [2019-12-18 22:48:35,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:48:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 39255 states and 124025 transitions. [2019-12-18 22:48:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:48:35,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:35,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:35,484 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash -871413024, now seen corresponding path program 2 times [2019-12-18 22:48:35,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:35,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842499787] [2019-12-18 22:48:35,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:35,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842499787] [2019-12-18 22:48:35,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:35,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:48:35,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038072125] [2019-12-18 22:48:35,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:48:35,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:35,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:48:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:35,923 INFO L87 Difference]: Start difference. First operand 39255 states and 124025 transitions. Second operand 3 states. [2019-12-18 22:48:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:36,052 INFO L93 Difference]: Finished difference Result 29796 states and 92689 transitions. [2019-12-18 22:48:36,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:48:36,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:48:36,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:36,094 INFO L225 Difference]: With dead ends: 29796 [2019-12-18 22:48:36,094 INFO L226 Difference]: Without dead ends: 29796 [2019-12-18 22:48:36,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:48:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29796 states. [2019-12-18 22:48:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29796 to 28150. [2019-12-18 22:48:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28150 states. [2019-12-18 22:48:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28150 states to 28150 states and 87484 transitions. [2019-12-18 22:48:36,536 INFO L78 Accepts]: Start accepts. Automaton has 28150 states and 87484 transitions. Word has length 66 [2019-12-18 22:48:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:36,536 INFO L462 AbstractCegarLoop]: Abstraction has 28150 states and 87484 transitions. [2019-12-18 22:48:36,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:48:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28150 states and 87484 transitions. [2019-12-18 22:48:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:48:36,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:36,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:36,573 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:48:36,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:36,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-18 22:48:36,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:36,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653121367] [2019-12-18 22:48:36,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:36,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653121367] [2019-12-18 22:48:36,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:36,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:48:36,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362553408] [2019-12-18 22:48:36,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:48:36,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:36,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:48:36,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:48:36,964 INFO L87 Difference]: Start difference. First operand 28150 states and 87484 transitions. Second operand 15 states. [2019-12-18 22:48:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:41,565 INFO L93 Difference]: Finished difference Result 61360 states and 188106 transitions. [2019-12-18 22:48:41,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 22:48:41,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 22:48:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:41,657 INFO L225 Difference]: With dead ends: 61360 [2019-12-18 22:48:41,657 INFO L226 Difference]: Without dead ends: 51596 [2019-12-18 22:48:41,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=620, Invalid=3412, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 22:48:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51596 states. [2019-12-18 22:48:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51596 to 28910. [2019-12-18 22:48:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28910 states. [2019-12-18 22:48:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28910 states to 28910 states and 89377 transitions. [2019-12-18 22:48:42,513 INFO L78 Accepts]: Start accepts. Automaton has 28910 states and 89377 transitions. Word has length 67 [2019-12-18 22:48:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:42,514 INFO L462 AbstractCegarLoop]: Abstraction has 28910 states and 89377 transitions. [2019-12-18 22:48:42,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:48:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 28910 states and 89377 transitions. [2019-12-18 22:48:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:48:42,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:42,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:42,548 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-18 22:48:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 2 times [2019-12-18 22:48:42,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:42,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801641552] [2019-12-18 22:48:42,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:42,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801641552] [2019-12-18 22:48:42,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:42,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:48:42,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274878136] [2019-12-18 22:48:42,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:48:42,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:42,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:48:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:48:42,749 INFO L87 Difference]: Start difference. First operand 28910 states and 89377 transitions. Second operand 12 states. [2019-12-18 22:48:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:44,390 INFO L93 Difference]: Finished difference Result 61137 states and 189423 transitions. [2019-12-18 22:48:44,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:48:44,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 22:48:44,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:44,458 INFO L225 Difference]: With dead ends: 61137 [2019-12-18 22:48:44,458 INFO L226 Difference]: Without dead ends: 44502 [2019-12-18 22:48:44,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 22:48:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44502 states. [2019-12-18 22:48:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44502 to 27222. [2019-12-18 22:48:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27222 states. [2019-12-18 22:48:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27222 states to 27222 states and 83885 transitions. [2019-12-18 22:48:44,986 INFO L78 Accepts]: Start accepts. Automaton has 27222 states and 83885 transitions. Word has length 67 [2019-12-18 22:48:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:44,986 INFO L462 AbstractCegarLoop]: Abstraction has 27222 states and 83885 transitions. [2019-12-18 22:48:44,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:48:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27222 states and 83885 transitions. [2019-12-18 22:48:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:48:45,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:45,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:45,016 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-18 22:48:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:45,016 INFO L82 PathProgramCache]: Analyzing trace with hash 397550642, now seen corresponding path program 1 times [2019-12-18 22:48:45,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:45,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562268720] [2019-12-18 22:48:45,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:48:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:48:45,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562268720] [2019-12-18 22:48:45,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:48:45,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:48:45,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488876043] [2019-12-18 22:48:45,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:48:45,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:48:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:48:45,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:48:45,125 INFO L87 Difference]: Start difference. First operand 27222 states and 83885 transitions. Second operand 9 states. [2019-12-18 22:48:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:48:47,017 INFO L93 Difference]: Finished difference Result 57506 states and 179533 transitions. [2019-12-18 22:48:47,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 22:48:47,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 22:48:47,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:48:47,105 INFO L225 Difference]: With dead ends: 57506 [2019-12-18 22:48:47,106 INFO L226 Difference]: Without dead ends: 57506 [2019-12-18 22:48:47,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:48:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57506 states. [2019-12-18 22:48:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57506 to 30386. [2019-12-18 22:48:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30386 states. [2019-12-18 22:48:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30386 states to 30386 states and 94429 transitions. [2019-12-18 22:48:47,764 INFO L78 Accepts]: Start accepts. Automaton has 30386 states and 94429 transitions. Word has length 67 [2019-12-18 22:48:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:48:47,764 INFO L462 AbstractCegarLoop]: Abstraction has 30386 states and 94429 transitions. [2019-12-18 22:48:47,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:48:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 30386 states and 94429 transitions. [2019-12-18 22:48:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:48:47,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:48:47,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:48:47,796 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-18 22:48:47,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:48:47,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 3 times [2019-12-18 22:48:47,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:48:47,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492742609] [2019-12-18 22:48:47,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:48:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:48:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:48:47,906 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:48:47,907 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:48:47,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 |v_ULTIMATE.start_main_~#t2287~0.offset_17|) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2287~0.base_23|) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_23| 1)) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2287~0.base_23| 4)) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_23|) 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_23|) |v_ULTIMATE.start_main_~#t2287~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~z$r_buff1_thd1~0_16) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_13|, #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_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t2287~0.base=|v_ULTIMATE.start_main_~#t2287~0.base_23|, ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, 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_7, 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_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_17|, 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_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2287~0.offset=|v_ULTIMATE.start_main_~#t2287~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ULTIMATE.start_main_~#t2289~0.offset, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2288~0.offset, ULTIMATE.start_main_~#t2289~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~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_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2287~0.base, #NULL.base, ULTIMATE.start_main_~#t2287~0.offset, ULTIMATE.start_main_~#t2288~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 22:48:47,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2288~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2288~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9|) |v_ULTIMATE.start_main_~#t2288~0.offset_8| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2288~0.offset_8|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2288~0.offset] because there is no mapped edge [2019-12-18 22:48:47,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork0_~arg.offset_Out1787161380 |P0Thread1of1ForFork0_#in~arg.offset_In1787161380|) (= 1 ~z$w_buff0~0_Out1787161380) (= ~z$w_buff1_used~0_Out1787161380 ~z$w_buff0_used~0_In1787161380) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1787161380|) (= ~z$w_buff0~0_In1787161380 ~z$w_buff1~0_Out1787161380) (= P0Thread1of1ForFork0_~arg.base_Out1787161380 |P0Thread1of1ForFork0_#in~arg.base_In1787161380|) (= 0 (mod ~z$w_buff1_used~0_Out1787161380 256)) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1787161380| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1787161380) (= 1 ~z$w_buff0_used~0_Out1787161380)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1787161380|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1787161380, ~z$w_buff0~0=~z$w_buff0~0_In1787161380, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1787161380|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1787161380|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1787161380, ~z$w_buff0~0=~z$w_buff0~0_Out1787161380, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1787161380, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1787161380, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1787161380|, ~z$w_buff1~0=~z$w_buff1~0_Out1787161380, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1787161380, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1787161380|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1787161380} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 22:48:47,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11|) |v_ULTIMATE.start_main_~#t2289~0.offset_9| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2289~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2289~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2289~0.offset, #length, ULTIMATE.start_main_~#t2289~0.base] because there is no mapped edge [2019-12-18 22:48:47,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-903821784 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-903821784 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out-903821784| |P1Thread1of1ForFork1_#t~ite9_Out-903821784|))) (or (and (= ~z~0_In-903821784 |P1Thread1of1ForFork1_#t~ite9_Out-903821784|) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) .cse0 (= ~z$w_buff1~0_In-903821784 |P1Thread1of1ForFork1_#t~ite9_Out-903821784|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-903821784, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-903821784, ~z$w_buff1~0=~z$w_buff1~0_In-903821784, ~z~0=~z~0_In-903821784} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-903821784|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-903821784, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-903821784, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-903821784|, ~z$w_buff1~0=~z$w_buff1~0_In-903821784, ~z~0=~z~0_In-903821784} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 22:48:47,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In264074196 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In264074196 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out264074196| ~z$w_buff0_used~0_In264074196)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out264074196| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In264074196, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In264074196} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In264074196, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out264074196|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In264074196} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:48:47,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1028993432 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1028993432 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1028993432 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1028993432 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1028993432 |P1Thread1of1ForFork1_#t~ite12_Out1028993432|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out1028993432| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1028993432, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1028993432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028993432, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1028993432} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1028993432, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1028993432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028993432, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1028993432|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1028993432} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:48:47,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1259775689 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1259775689 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-1259775689 |P1Thread1of1ForFork1_#t~ite13_Out-1259775689|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1259775689|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1259775689, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1259775689} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1259775689, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1259775689|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1259775689} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:48:47,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1255367125 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In-1255367125| |P2Thread1of1ForFork2_#t~ite23_Out-1255367125|) (= ~z$w_buff1~0_In-1255367125 |P2Thread1of1ForFork2_#t~ite24_Out-1255367125|) (not .cse0)) (and (= ~z$w_buff1~0_In-1255367125 |P2Thread1of1ForFork2_#t~ite23_Out-1255367125|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1255367125 256)))) (or (= (mod ~z$w_buff0_used~0_In-1255367125 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1255367125 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1255367125 256))))) (= |P2Thread1of1ForFork2_#t~ite24_Out-1255367125| |P2Thread1of1ForFork2_#t~ite23_Out-1255367125|) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1255367125|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1255367125, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1255367125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1255367125, ~z$w_buff1~0=~z$w_buff1~0_In-1255367125, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1255367125, ~weak$$choice2~0=~weak$$choice2~0_In-1255367125} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1255367125|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1255367125|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1255367125, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1255367125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1255367125, ~z$w_buff1~0=~z$w_buff1~0_In-1255367125, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1255367125, ~weak$$choice2~0=~weak$$choice2~0_In-1255367125} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 22:48:47,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1478670153 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out1478670153| ~z$w_buff0_used~0_In1478670153) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1478670153 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In1478670153 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In1478670153 256) 0) (and (= (mod ~z$w_buff1_used~0_In1478670153 256) 0) .cse0))) (= |P2Thread1of1ForFork2_#t~ite26_Out1478670153| |P2Thread1of1ForFork2_#t~ite27_Out1478670153|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite26_In1478670153| |P2Thread1of1ForFork2_#t~ite26_Out1478670153|) (= |P2Thread1of1ForFork2_#t~ite27_Out1478670153| ~z$w_buff0_used~0_In1478670153) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1478670153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1478670153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1478670153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478670153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1478670153, ~weak$$choice2~0=~weak$$choice2~0_In1478670153} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1478670153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1478670153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1478670153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478670153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1478670153, ~weak$$choice2~0=~weak$$choice2~0_In1478670153, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1478670153|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 22:48:47,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-175367507 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-175367507 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-175367507 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-175367507 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-175367507| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out-175367507| ~z$r_buff1_thd2~0_In-175367507)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-175367507, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-175367507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-175367507, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-175367507} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-175367507, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-175367507, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-175367507, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-175367507|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-175367507} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:48:47,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:48:47,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-606770889 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-606770889| ~z$w_buff1_used~0_In-606770889) .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-606770889| |P2Thread1of1ForFork2_#t~ite30_Out-606770889|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-606770889 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-606770889 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-606770889 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In-606770889 256) 0) .cse1)))) (and (= ~z$w_buff1_used~0_In-606770889 |P2Thread1of1ForFork2_#t~ite30_Out-606770889|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In-606770889| |P2Thread1of1ForFork2_#t~ite29_Out-606770889|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-606770889, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-606770889, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-606770889, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-606770889, ~weak$$choice2~0=~weak$$choice2~0_In-606770889, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-606770889|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-606770889|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-606770889, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-606770889, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-606770889, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-606770889, ~weak$$choice2~0=~weak$$choice2~0_In-606770889, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-606770889|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 22:48:47,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 22:48:47,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 22:48:47,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In418124095 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In418124095 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out418124095| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out418124095| ~z$w_buff0_used~0_In418124095) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In418124095, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In418124095} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out418124095|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In418124095, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In418124095} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:48:47,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1114620541 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1114620541 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1114620541 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1114620541 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1114620541 |P0Thread1of1ForFork0_#t~ite6_Out1114620541|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1114620541|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1114620541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114620541, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1114620541} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1114620541|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1114620541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114620541, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1114620541} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:48:47,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1227626347 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1227626347 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-1227626347 0)) (and (= ~z$r_buff0_thd1~0_In-1227626347 ~z$r_buff0_thd1~0_Out-1227626347) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1227626347, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1227626347} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1227626347, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1227626347|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1227626347} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:48:47,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In855135178 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In855135178 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In855135178 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In855135178 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out855135178| ~z$r_buff1_thd1~0_In855135178) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out855135178| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In855135178, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In855135178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In855135178, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In855135178} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In855135178, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out855135178|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In855135178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In855135178, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In855135178} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:48:47,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:48:47,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-390281085 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-390281085 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out-390281085| |P2Thread1of1ForFork2_#t~ite39_Out-390281085|))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-390281085| ~z$w_buff1~0_In-390281085) (not .cse0) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-390281085| ~z~0_In-390281085) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, ~z$w_buff1~0=~z$w_buff1~0_In-390281085, ~z~0=~z~0_In-390281085} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, ~z$w_buff1~0=~z$w_buff1~0_In-390281085, ~z~0=~z~0_In-390281085, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-390281085|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-390281085|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 22:48:47,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In772226965 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In772226965 256) 0))) (or (and (= ~z$w_buff0_used~0_In772226965 |P2Thread1of1ForFork2_#t~ite40_Out772226965|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out772226965|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In772226965, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In772226965} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In772226965, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In772226965, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out772226965|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 22:48:47,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1402730083 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1402730083 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1402730083 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1402730083 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out1402730083| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out1402730083| ~z$w_buff1_used~0_In1402730083) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1402730083, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1402730083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402730083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1402730083} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1402730083|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1402730083, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1402730083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402730083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1402730083} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 22:48:47,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1148049817 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1148049817 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out1148049817| 0)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out1148049817| ~z$r_buff0_thd3~0_In1148049817) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1148049817, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1148049817} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out1148049817|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1148049817, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1148049817} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 22:48:47,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1618924566 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1618924566 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1618924566 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1618924566 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1618924566 |P2Thread1of1ForFork2_#t~ite43_Out1618924566|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1618924566|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1618924566, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1618924566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1618924566, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1618924566} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1618924566, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1618924566, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1618924566|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1618924566, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1618924566} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 22:48:47,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:48:47,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:48:47,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In125823701 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In125823701 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out125823701| |ULTIMATE.start_main_#t~ite47_Out125823701|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out125823701| ~z$w_buff1~0_In125823701) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out125823701| ~z~0_In125823701) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In125823701, ~z$w_buff1_used~0=~z$w_buff1_used~0_In125823701, ~z$w_buff1~0=~z$w_buff1~0_In125823701, ~z~0=~z~0_In125823701} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In125823701, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out125823701|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In125823701, ~z$w_buff1~0=~z$w_buff1~0_In125823701, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out125823701|, ~z~0=~z~0_In125823701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:48:47,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-798235608 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-798235608 256)))) (or (and (= ~z$w_buff0_used~0_In-798235608 |ULTIMATE.start_main_#t~ite49_Out-798235608|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-798235608|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-798235608, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-798235608} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-798235608, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-798235608, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-798235608|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 22:48:47,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2093005893 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2093005893 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2093005893 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2093005893 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out2093005893| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In2093005893 |ULTIMATE.start_main_#t~ite50_Out2093005893|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2093005893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2093005893, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2093005893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2093005893} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2093005893|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2093005893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2093005893, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2093005893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2093005893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 22:48:47,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In715742688 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In715742688 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In715742688 |ULTIMATE.start_main_#t~ite51_Out715742688|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out715742688| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In715742688, ~z$w_buff0_used~0=~z$w_buff0_used~0_In715742688} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In715742688, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out715742688|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In715742688} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 22:48:47,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-60555463 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-60555463 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-60555463 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-60555463 256)))) (or (and (= ~z$r_buff1_thd0~0_In-60555463 |ULTIMATE.start_main_#t~ite52_Out-60555463|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-60555463| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-60555463, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-60555463, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60555463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60555463} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-60555463|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-60555463, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-60555463, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60555463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60555463} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 22:48:47,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:48:48,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:48:48 BasicIcfg [2019-12-18 22:48:48,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:48:48,020 INFO L168 Benchmark]: Toolchain (without parser) took 107474.01 ms. Allocated memory was 141.0 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 98.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 22:48:48,020 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 141.0 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:48:48,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.13 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 98.2 MB in the beginning and 154.5 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:48,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.52 ms. Allocated memory is still 201.3 MB. Free memory was 154.5 MB in the beginning and 151.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:48,022 INFO L168 Benchmark]: Boogie Preprocessor took 50.25 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:48,022 INFO L168 Benchmark]: RCFGBuilder took 854.49 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 99.1 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:48:48,023 INFO L168 Benchmark]: TraceAbstraction took 105607.72 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 22:48:48,025 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.19 ms. Allocated memory is still 141.0 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 882.13 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 98.2 MB in the beginning and 154.5 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.52 ms. Allocated memory is still 201.3 MB. Free memory was 154.5 MB in the beginning and 151.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.25 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.49 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 99.1 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105607.72 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6847 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=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] [L744] 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_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] [L822] FCALL, FORK 0 pthread_create(&t2288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L824] FCALL, FORK 0 pthread_create(&t2289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=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=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] [L764] 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_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=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] [L764] 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) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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_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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] 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_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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 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 [L786] 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)) [L787] 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)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 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)) [L789] 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)) [L791] 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 [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 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)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 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 [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, 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] [L744] 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) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 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 [L797] 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) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 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 [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_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=7, weak$$choice2=1, 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] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.2s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6821 SDtfs, 9738 SDslu, 22361 SDs, 0 SdLazy, 15868 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 52 SyntacticMatches, 31 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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: 42.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 349250 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1549 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1452 ConstructedInterpolants, 0 QuantifiedInterpolants, 313936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...