/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:59:50,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:59:50,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:59:50,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:59:50,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:59:50,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:59:50,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:59:50,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:59:50,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:59:50,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:59:50,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:59:50,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:59:50,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:59:50,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:59:50,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:59:50,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:59:50,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:59:50,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:59:50,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:59:50,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:59:50,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:59:50,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:59:50,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:59:50,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:59:50,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:59:50,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:59:50,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:59:50,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:59:50,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:59:50,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:59:50,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:59:50,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:59:50,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:59:50,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:59:50,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:59:50,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:59:50,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:59:50,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:59:50,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:59:50,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:59:50,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:59:50,446 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-SemanticLbe.epf [2019-12-27 02:59:50,461 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:59:50,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:59:50,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:59:50,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:59:50,463 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:59:50,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:59:50,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:59:50,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:59:50,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:59:50,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:59:50,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:59:50,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:59:50,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:59:50,465 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:59:50,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:59:50,465 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:59:50,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:59:50,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:59:50,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:59:50,466 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:59:50,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:59:50,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:59:50,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:59:50,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:59:50,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:59:50,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:59:50,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:59:50,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:59:50,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:59:50,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:59:50,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:59:50,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:59:50,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:59:50,750 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:59:50,751 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-27 02:59:50,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ae6d74c/f99f24912293454190b7f2bec1fb4872/FLAGb14fe464f [2019-12-27 02:59:51,400 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:59:51,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-27 02:59:51,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ae6d74c/f99f24912293454190b7f2bec1fb4872/FLAGb14fe464f [2019-12-27 02:59:51,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ae6d74c/f99f24912293454190b7f2bec1fb4872 [2019-12-27 02:59:51,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:59:51,666 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:59:51,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:59:51,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:59:51,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:59:51,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:59:51" (1/1) ... [2019-12-27 02:59:51,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e71c5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:51, skipping insertion in model container [2019-12-27 02:59:51,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:59:51" (1/1) ... [2019-12-27 02:59:51,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:59:51,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:59:52,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:59:52,282 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:59:52,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:59:52,429 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:59:52,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52 WrapperNode [2019-12-27 02:59:52,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:59:52,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:59:52,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:59:52,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:59:52,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... [2019-12-27 02:59:52,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... [2019-12-27 02:59:52,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:59:52,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:59:52,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:59:52,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:59:52,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... [2019-12-27 02:59:52,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... [2019-12-27 02:59:52,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... [2019-12-27 02:59:52,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... [2019-12-27 02:59:52,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... [2019-12-27 02:59:52,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... [2019-12-27 02:59:52,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... [2019-12-27 02:59:52,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:59:52,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:59:52,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:59:52,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:59:52,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:59:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:59:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:59:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:59:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:59:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:59:52,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:59:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:59:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:59:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:59:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:59:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:59:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:59:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:59:52,626 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:59:53,473 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:59:53,473 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:59:53,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:59:53 BoogieIcfgContainer [2019-12-27 02:59:53,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:59:53,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:59:53,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:59:53,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:59:53,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:59:51" (1/3) ... [2019-12-27 02:59:53,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148c7f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:59:53, skipping insertion in model container [2019-12-27 02:59:53,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:52" (2/3) ... [2019-12-27 02:59:53,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148c7f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:59:53, skipping insertion in model container [2019-12-27 02:59:53,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:59:53" (3/3) ... [2019-12-27 02:59:53,483 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc.i [2019-12-27 02:59:53,494 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:59:53,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:59:53,503 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:59:53,504 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:59:53,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,552 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,552 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,552 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,585 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,586 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,654 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,655 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,655 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,662 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,664 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:53,688 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:59:53,709 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:59:53,709 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:59:53,709 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:59:53,710 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:59:53,710 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:59:53,710 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:59:53,710 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:59:53,710 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:59:53,726 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 02:59:53,728 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 02:59:53,833 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 02:59:53,834 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:59:53,852 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:59:53,880 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 02:59:53,933 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 02:59:53,933 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:59:53,941 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:59:53,963 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:59:53,964 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:59:59,633 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 02:59:59,757 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 02:59:59,776 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77200 [2019-12-27 02:59:59,776 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 02:59:59,779 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 03:00:14,020 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 03:00:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 03:00:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:00:14,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:14,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:00:14,030 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:14,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:14,036 INFO L82 PathProgramCache]: Analyzing trace with hash 909908, now seen corresponding path program 1 times [2019-12-27 03:00:14,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:14,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841784834] [2019-12-27 03:00:14,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:14,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841784834] [2019-12-27 03:00:14,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:14,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:00:14,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094963403] [2019-12-27 03:00:14,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:14,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:14,280 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 03:00:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:16,926 INFO L93 Difference]: Finished difference Result 101472 states and 432734 transitions. [2019-12-27 03:00:16,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:16,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:00:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:17,693 INFO L225 Difference]: With dead ends: 101472 [2019-12-27 03:00:17,694 INFO L226 Difference]: Without dead ends: 95232 [2019-12-27 03:00:17,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95232 states. [2019-12-27 03:00:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95232 to 95232. [2019-12-27 03:00:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95232 states. [2019-12-27 03:00:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95232 states to 95232 states and 405538 transitions. [2019-12-27 03:00:29,097 INFO L78 Accepts]: Start accepts. Automaton has 95232 states and 405538 transitions. Word has length 3 [2019-12-27 03:00:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:29,097 INFO L462 AbstractCegarLoop]: Abstraction has 95232 states and 405538 transitions. [2019-12-27 03:00:29,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 95232 states and 405538 transitions. [2019-12-27 03:00:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:00:29,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:29,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:29,103 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:29,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:29,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1729820714, now seen corresponding path program 1 times [2019-12-27 03:00:29,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:29,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246582997] [2019-12-27 03:00:29,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:29,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246582997] [2019-12-27 03:00:29,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:29,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:29,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322212245] [2019-12-27 03:00:29,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:29,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:29,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:29,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:29,218 INFO L87 Difference]: Start difference. First operand 95232 states and 405538 transitions. Second operand 4 states. [2019-12-27 03:00:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:34,377 INFO L93 Difference]: Finished difference Result 151692 states and 619304 transitions. [2019-12-27 03:00:34,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:34,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:00:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:34,989 INFO L225 Difference]: With dead ends: 151692 [2019-12-27 03:00:34,989 INFO L226 Difference]: Without dead ends: 151643 [2019-12-27 03:00:34,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151643 states. [2019-12-27 03:00:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151643 to 138429. [2019-12-27 03:00:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138429 states. [2019-12-27 03:00:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138429 states to 138429 states and 572602 transitions. [2019-12-27 03:00:42,100 INFO L78 Accepts]: Start accepts. Automaton has 138429 states and 572602 transitions. Word has length 11 [2019-12-27 03:00:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:42,101 INFO L462 AbstractCegarLoop]: Abstraction has 138429 states and 572602 transitions. [2019-12-27 03:00:42,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 138429 states and 572602 transitions. [2019-12-27 03:00:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:00:42,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:42,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:42,108 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1791451612, now seen corresponding path program 1 times [2019-12-27 03:00:42,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:42,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400257299] [2019-12-27 03:00:42,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:42,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400257299] [2019-12-27 03:00:42,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:42,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:42,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281154229] [2019-12-27 03:00:42,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:42,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:42,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:42,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:42,198 INFO L87 Difference]: Start difference. First operand 138429 states and 572602 transitions. Second operand 3 states. [2019-12-27 03:00:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:46,264 INFO L93 Difference]: Finished difference Result 30955 states and 100617 transitions. [2019-12-27 03:00:46,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:46,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:00:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:46,317 INFO L225 Difference]: With dead ends: 30955 [2019-12-27 03:00:46,318 INFO L226 Difference]: Without dead ends: 30955 [2019-12-27 03:00:46,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2019-12-27 03:00:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30955. [2019-12-27 03:00:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2019-12-27 03:00:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 100617 transitions. [2019-12-27 03:00:46,891 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 100617 transitions. Word has length 13 [2019-12-27 03:00:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:46,892 INFO L462 AbstractCegarLoop]: Abstraction has 30955 states and 100617 transitions. [2019-12-27 03:00:46,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 100617 transitions. [2019-12-27 03:00:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:00:46,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:46,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:46,894 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash -137996123, now seen corresponding path program 1 times [2019-12-27 03:00:46,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:46,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647650007] [2019-12-27 03:00:46,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:46,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647650007] [2019-12-27 03:00:46,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:46,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:46,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268479925] [2019-12-27 03:00:46,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:46,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:46,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:46,992 INFO L87 Difference]: Start difference. First operand 30955 states and 100617 transitions. Second operand 3 states. [2019-12-27 03:00:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:47,189 INFO L93 Difference]: Finished difference Result 47061 states and 152507 transitions. [2019-12-27 03:00:47,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:47,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 03:00:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:47,272 INFO L225 Difference]: With dead ends: 47061 [2019-12-27 03:00:47,272 INFO L226 Difference]: Without dead ends: 47061 [2019-12-27 03:00:47,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:47,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47061 states. [2019-12-27 03:00:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47061 to 33925. [2019-12-27 03:00:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33925 states. [2019-12-27 03:00:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33925 states to 33925 states and 111057 transitions. [2019-12-27 03:00:48,224 INFO L78 Accepts]: Start accepts. Automaton has 33925 states and 111057 transitions. Word has length 16 [2019-12-27 03:00:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:48,226 INFO L462 AbstractCegarLoop]: Abstraction has 33925 states and 111057 transitions. [2019-12-27 03:00:48,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 33925 states and 111057 transitions. [2019-12-27 03:00:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:00:48,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:48,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:48,228 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash -137876649, now seen corresponding path program 1 times [2019-12-27 03:00:48,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:48,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694160505] [2019-12-27 03:00:48,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:48,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694160505] [2019-12-27 03:00:48,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:48,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:48,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196162750] [2019-12-27 03:00:48,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:48,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:48,295 INFO L87 Difference]: Start difference. First operand 33925 states and 111057 transitions. Second operand 4 states. [2019-12-27 03:00:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:48,666 INFO L93 Difference]: Finished difference Result 41000 states and 132194 transitions. [2019-12-27 03:00:48,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:48,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 03:00:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:48,735 INFO L225 Difference]: With dead ends: 41000 [2019-12-27 03:00:48,736 INFO L226 Difference]: Without dead ends: 41000 [2019-12-27 03:00:48,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41000 states. [2019-12-27 03:00:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41000 to 37405. [2019-12-27 03:00:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37405 states. [2019-12-27 03:00:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 121522 transitions. [2019-12-27 03:00:49,777 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 121522 transitions. Word has length 16 [2019-12-27 03:00:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:49,777 INFO L462 AbstractCegarLoop]: Abstraction has 37405 states and 121522 transitions. [2019-12-27 03:00:49,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 121522 transitions. [2019-12-27 03:00:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:00:49,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:49,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:49,779 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash -219444717, now seen corresponding path program 1 times [2019-12-27 03:00:49,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:49,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086477878] [2019-12-27 03:00:49,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:49,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086477878] [2019-12-27 03:00:49,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:49,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:49,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152019544] [2019-12-27 03:00:49,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:49,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:49,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:49,868 INFO L87 Difference]: Start difference. First operand 37405 states and 121522 transitions. Second operand 4 states. [2019-12-27 03:00:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:50,251 INFO L93 Difference]: Finished difference Result 45062 states and 145323 transitions. [2019-12-27 03:00:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:50,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 03:00:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:50,328 INFO L225 Difference]: With dead ends: 45062 [2019-12-27 03:00:50,328 INFO L226 Difference]: Without dead ends: 45062 [2019-12-27 03:00:50,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45062 states. [2019-12-27 03:00:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45062 to 38365. [2019-12-27 03:00:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38365 states. [2019-12-27 03:00:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38365 states to 38365 states and 124903 transitions. [2019-12-27 03:00:50,988 INFO L78 Accepts]: Start accepts. Automaton has 38365 states and 124903 transitions. Word has length 16 [2019-12-27 03:00:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:50,988 INFO L462 AbstractCegarLoop]: Abstraction has 38365 states and 124903 transitions. [2019-12-27 03:00:50,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 38365 states and 124903 transitions. [2019-12-27 03:00:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:00:51,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:51,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:51,000 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1066994180, now seen corresponding path program 1 times [2019-12-27 03:00:51,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:51,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595696199] [2019-12-27 03:00:51,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:51,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595696199] [2019-12-27 03:00:51,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:51,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:51,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312825624] [2019-12-27 03:00:51,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:51,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:51,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:51,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:51,087 INFO L87 Difference]: Start difference. First operand 38365 states and 124903 transitions. Second operand 5 states. [2019-12-27 03:00:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:51,988 INFO L93 Difference]: Finished difference Result 53898 states and 171065 transitions. [2019-12-27 03:00:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:00:51,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:00:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:52,075 INFO L225 Difference]: With dead ends: 53898 [2019-12-27 03:00:52,075 INFO L226 Difference]: Without dead ends: 53891 [2019-12-27 03:00:52,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:00:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. [2019-12-27 03:00:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53891 to 39721. [2019-12-27 03:00:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39721 states. [2019-12-27 03:00:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39721 states to 39721 states and 129036 transitions. [2019-12-27 03:00:52,798 INFO L78 Accepts]: Start accepts. Automaton has 39721 states and 129036 transitions. Word has length 22 [2019-12-27 03:00:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:52,799 INFO L462 AbstractCegarLoop]: Abstraction has 39721 states and 129036 transitions. [2019-12-27 03:00:52,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 39721 states and 129036 transitions. [2019-12-27 03:00:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:00:52,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:52,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:52,808 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:52,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1734556852, now seen corresponding path program 1 times [2019-12-27 03:00:52,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:52,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507555242] [2019-12-27 03:00:52,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:52,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507555242] [2019-12-27 03:00:52,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:52,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:52,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740205025] [2019-12-27 03:00:52,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:52,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:52,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:52,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:52,892 INFO L87 Difference]: Start difference. First operand 39721 states and 129036 transitions. Second operand 5 states. [2019-12-27 03:00:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:53,505 INFO L93 Difference]: Finished difference Result 56181 states and 177938 transitions. [2019-12-27 03:00:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:00:53,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 03:00:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:53,599 INFO L225 Difference]: With dead ends: 56181 [2019-12-27 03:00:53,599 INFO L226 Difference]: Without dead ends: 56174 [2019-12-27 03:00:53,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:00:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56174 states. [2019-12-27 03:00:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56174 to 38054. [2019-12-27 03:00:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38054 states. [2019-12-27 03:00:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 123745 transitions. [2019-12-27 03:00:54,631 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 123745 transitions. Word has length 22 [2019-12-27 03:00:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:54,631 INFO L462 AbstractCegarLoop]: Abstraction has 38054 states and 123745 transitions. [2019-12-27 03:00:54,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 123745 transitions. [2019-12-27 03:00:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:00:54,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:54,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:54,642 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash -779030427, now seen corresponding path program 1 times [2019-12-27 03:00:54,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:54,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994671056] [2019-12-27 03:00:54,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:54,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994671056] [2019-12-27 03:00:54,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:54,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:54,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338091079] [2019-12-27 03:00:54,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:54,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:54,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:54,701 INFO L87 Difference]: Start difference. First operand 38054 states and 123745 transitions. Second operand 4 states. [2019-12-27 03:00:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:54,771 INFO L93 Difference]: Finished difference Result 15260 states and 46817 transitions. [2019-12-27 03:00:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:00:54,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:00:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:54,802 INFO L225 Difference]: With dead ends: 15260 [2019-12-27 03:00:54,802 INFO L226 Difference]: Without dead ends: 15260 [2019-12-27 03:00:54,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2019-12-27 03:00:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 14988. [2019-12-27 03:00:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2019-12-27 03:00:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46041 transitions. [2019-12-27 03:00:55,136 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46041 transitions. Word has length 25 [2019-12-27 03:00:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:55,138 INFO L462 AbstractCegarLoop]: Abstraction has 14988 states and 46041 transitions. [2019-12-27 03:00:55,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46041 transitions. [2019-12-27 03:00:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 03:00:55,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:55,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:55,155 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1740727520, now seen corresponding path program 1 times [2019-12-27 03:00:55,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:55,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488954871] [2019-12-27 03:00:55,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:55,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488954871] [2019-12-27 03:00:55,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:55,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:55,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082193059] [2019-12-27 03:00:55,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:55,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:55,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:55,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:55,262 INFO L87 Difference]: Start difference. First operand 14988 states and 46041 transitions. Second operand 5 states. [2019-12-27 03:00:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:55,701 INFO L93 Difference]: Finished difference Result 19496 states and 58771 transitions. [2019-12-27 03:00:55,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:00:55,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 03:00:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:55,741 INFO L225 Difference]: With dead ends: 19496 [2019-12-27 03:00:55,741 INFO L226 Difference]: Without dead ends: 19496 [2019-12-27 03:00:55,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:00:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2019-12-27 03:00:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 18230. [2019-12-27 03:00:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-27 03:00:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 55601 transitions. [2019-12-27 03:00:56,133 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 55601 transitions. Word has length 27 [2019-12-27 03:00:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:56,134 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 55601 transitions. [2019-12-27 03:00:56,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 55601 transitions. [2019-12-27 03:00:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:00:56,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:56,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:56,153 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987791, now seen corresponding path program 1 times [2019-12-27 03:00:56,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:56,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608629995] [2019-12-27 03:00:56,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:56,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608629995] [2019-12-27 03:00:56,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:56,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:56,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981903242] [2019-12-27 03:00:56,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:56,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:56,260 INFO L87 Difference]: Start difference. First operand 18230 states and 55601 transitions. Second operand 5 states. [2019-12-27 03:00:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:56,824 INFO L93 Difference]: Finished difference Result 21384 states and 64177 transitions. [2019-12-27 03:00:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:00:56,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:00:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:56,861 INFO L225 Difference]: With dead ends: 21384 [2019-12-27 03:00:56,861 INFO L226 Difference]: Without dead ends: 21384 [2019-12-27 03:00:56,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:00:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21384 states. [2019-12-27 03:00:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21384 to 17323. [2019-12-27 03:00:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-12-27 03:00:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 52883 transitions. [2019-12-27 03:00:57,130 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 52883 transitions. Word has length 28 [2019-12-27 03:00:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:57,130 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 52883 transitions. [2019-12-27 03:00:57,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 52883 transitions. [2019-12-27 03:00:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 03:00:57,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:57,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:57,147 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1850577991, now seen corresponding path program 1 times [2019-12-27 03:00:57,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:57,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094000697] [2019-12-27 03:00:57,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:57,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094000697] [2019-12-27 03:00:57,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:57,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:00:57,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952993681] [2019-12-27 03:00:57,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:57,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:57,228 INFO L87 Difference]: Start difference. First operand 17323 states and 52883 transitions. Second operand 6 states. [2019-12-27 03:00:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:57,959 INFO L93 Difference]: Finished difference Result 24527 states and 73018 transitions. [2019-12-27 03:00:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:00:57,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 03:00:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:58,002 INFO L225 Difference]: With dead ends: 24527 [2019-12-27 03:00:58,002 INFO L226 Difference]: Without dead ends: 24527 [2019-12-27 03:00:58,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:00:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24527 states. [2019-12-27 03:00:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24527 to 18692. [2019-12-27 03:00:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18692 states. [2019-12-27 03:00:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18692 states to 18692 states and 56821 transitions. [2019-12-27 03:00:58,304 INFO L78 Accepts]: Start accepts. Automaton has 18692 states and 56821 transitions. Word has length 33 [2019-12-27 03:00:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:58,305 INFO L462 AbstractCegarLoop]: Abstraction has 18692 states and 56821 transitions. [2019-12-27 03:00:58,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 18692 states and 56821 transitions. [2019-12-27 03:00:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 03:00:58,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:58,324 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] [2019-12-27 03:00:58,324 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1933444630, now seen corresponding path program 1 times [2019-12-27 03:00:58,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:58,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584521331] [2019-12-27 03:00:58,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:58,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584521331] [2019-12-27 03:00:58,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:58,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:00:58,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23038358] [2019-12-27 03:00:58,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:58,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:58,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:58,409 INFO L87 Difference]: Start difference. First operand 18692 states and 56821 transitions. Second operand 6 states. [2019-12-27 03:00:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:59,061 INFO L93 Difference]: Finished difference Result 23844 states and 71231 transitions. [2019-12-27 03:00:59,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:00:59,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 03:00:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:59,107 INFO L225 Difference]: With dead ends: 23844 [2019-12-27 03:00:59,108 INFO L226 Difference]: Without dead ends: 23844 [2019-12-27 03:00:59,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:00:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2019-12-27 03:00:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 15691. [2019-12-27 03:00:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15691 states. [2019-12-27 03:00:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15691 states to 15691 states and 48077 transitions. [2019-12-27 03:00:59,619 INFO L78 Accepts]: Start accepts. Automaton has 15691 states and 48077 transitions. Word has length 34 [2019-12-27 03:00:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:59,619 INFO L462 AbstractCegarLoop]: Abstraction has 15691 states and 48077 transitions. [2019-12-27 03:00:59,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15691 states and 48077 transitions. [2019-12-27 03:00:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 03:00:59,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:59,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:59,639 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -390301387, now seen corresponding path program 1 times [2019-12-27 03:00:59,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:59,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760678695] [2019-12-27 03:00:59,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:59,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760678695] [2019-12-27 03:00:59,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:59,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:59,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663477506] [2019-12-27 03:00:59,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:59,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:59,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:59,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:59,687 INFO L87 Difference]: Start difference. First operand 15691 states and 48077 transitions. Second operand 3 states. [2019-12-27 03:00:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:59,783 INFO L93 Difference]: Finished difference Result 29593 states and 90773 transitions. [2019-12-27 03:00:59,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:59,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 03:00:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:59,809 INFO L225 Difference]: With dead ends: 29593 [2019-12-27 03:00:59,809 INFO L226 Difference]: Without dead ends: 16129 [2019-12-27 03:00:59,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16129 states. [2019-12-27 03:01:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16129 to 16073. [2019-12-27 03:01:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-27 03:01:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 48010 transitions. [2019-12-27 03:01:00,039 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 48010 transitions. Word has length 39 [2019-12-27 03:01:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:00,039 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 48010 transitions. [2019-12-27 03:01:00,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 48010 transitions. [2019-12-27 03:01:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:01:00,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:00,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:00,055 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:00,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1543157030, now seen corresponding path program 1 times [2019-12-27 03:01:00,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:00,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747937186] [2019-12-27 03:01:00,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:00,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747937186] [2019-12-27 03:01:00,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:00,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:01:00,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785301763] [2019-12-27 03:01:00,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:00,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:00,132 INFO L87 Difference]: Start difference. First operand 16073 states and 48010 transitions. Second operand 5 states. [2019-12-27 03:01:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:00,750 INFO L93 Difference]: Finished difference Result 23632 states and 69938 transitions. [2019-12-27 03:01:00,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:01:00,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 03:01:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:00,794 INFO L225 Difference]: With dead ends: 23632 [2019-12-27 03:01:00,794 INFO L226 Difference]: Without dead ends: 23632 [2019-12-27 03:01:00,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:01:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23632 states. [2019-12-27 03:01:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23632 to 21777. [2019-12-27 03:01:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21777 states. [2019-12-27 03:01:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21777 states to 21777 states and 64983 transitions. [2019-12-27 03:01:01,121 INFO L78 Accepts]: Start accepts. Automaton has 21777 states and 64983 transitions. Word has length 40 [2019-12-27 03:01:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:01,121 INFO L462 AbstractCegarLoop]: Abstraction has 21777 states and 64983 transitions. [2019-12-27 03:01:01,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 21777 states and 64983 transitions. [2019-12-27 03:01:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:01:01,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:01,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:01,143 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash 838743556, now seen corresponding path program 2 times [2019-12-27 03:01:01,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:01,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485571691] [2019-12-27 03:01:01,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:01,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485571691] [2019-12-27 03:01:01,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:01,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:01:01,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683231768] [2019-12-27 03:01:01,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:01,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:01,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:01,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:01,200 INFO L87 Difference]: Start difference. First operand 21777 states and 64983 transitions. Second operand 5 states. [2019-12-27 03:01:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:01,292 INFO L93 Difference]: Finished difference Result 20526 states and 62067 transitions. [2019-12-27 03:01:01,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:01:01,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 03:01:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:01,318 INFO L225 Difference]: With dead ends: 20526 [2019-12-27 03:01:01,319 INFO L226 Difference]: Without dead ends: 18967 [2019-12-27 03:01:01,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18967 states. [2019-12-27 03:01:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18967 to 18092. [2019-12-27 03:01:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18092 states. [2019-12-27 03:01:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18092 states to 18092 states and 56295 transitions. [2019-12-27 03:01:01,585 INFO L78 Accepts]: Start accepts. Automaton has 18092 states and 56295 transitions. Word has length 40 [2019-12-27 03:01:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:01,585 INFO L462 AbstractCegarLoop]: Abstraction has 18092 states and 56295 transitions. [2019-12-27 03:01:01,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18092 states and 56295 transitions. [2019-12-27 03:01:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:01,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:01,613 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-27 03:01:01,613 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1449191354, now seen corresponding path program 1 times [2019-12-27 03:01:01,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:01,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380003220] [2019-12-27 03:01:01,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:01,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380003220] [2019-12-27 03:01:01,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:01,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:01:01,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348802794] [2019-12-27 03:01:01,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:01,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:01,671 INFO L87 Difference]: Start difference. First operand 18092 states and 56295 transitions. Second operand 3 states. [2019-12-27 03:01:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:01,793 INFO L93 Difference]: Finished difference Result 24294 states and 73055 transitions. [2019-12-27 03:01:01,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:01,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 03:01:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:02,014 INFO L225 Difference]: With dead ends: 24294 [2019-12-27 03:01:02,014 INFO L226 Difference]: Without dead ends: 24294 [2019-12-27 03:01:02,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24294 states. [2019-12-27 03:01:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24294 to 18274. [2019-12-27 03:01:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-12-27 03:01:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 55190 transitions. [2019-12-27 03:01:02,309 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 55190 transitions. Word has length 64 [2019-12-27 03:01:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:02,309 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 55190 transitions. [2019-12-27 03:01:02,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 55190 transitions. [2019-12-27 03:01:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:02,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:02,334 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-27 03:01:02,334 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:02,335 INFO L82 PathProgramCache]: Analyzing trace with hash -237391966, now seen corresponding path program 1 times [2019-12-27 03:01:02,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:02,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993913992] [2019-12-27 03:01:02,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:02,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993913992] [2019-12-27 03:01:02,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:02,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:01:02,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80851448] [2019-12-27 03:01:02,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:01:02,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:02,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:01:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:01:02,443 INFO L87 Difference]: Start difference. First operand 18274 states and 55190 transitions. Second operand 8 states. [2019-12-27 03:01:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:03,709 INFO L93 Difference]: Finished difference Result 80145 states and 240194 transitions. [2019-12-27 03:01:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:01:03,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 03:01:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:03,797 INFO L225 Difference]: With dead ends: 80145 [2019-12-27 03:01:03,797 INFO L226 Difference]: Without dead ends: 58918 [2019-12-27 03:01:03,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:01:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58918 states. [2019-12-27 03:01:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58918 to 21155. [2019-12-27 03:01:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21155 states. [2019-12-27 03:01:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 64148 transitions. [2019-12-27 03:01:04,393 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 64148 transitions. Word has length 64 [2019-12-27 03:01:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:04,393 INFO L462 AbstractCegarLoop]: Abstraction has 21155 states and 64148 transitions. [2019-12-27 03:01:04,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:01:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 64148 transitions. [2019-12-27 03:01:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:04,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:04,418 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-27 03:01:04,418 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1797634292, now seen corresponding path program 2 times [2019-12-27 03:01:04,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:04,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790434406] [2019-12-27 03:01:04,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:04,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790434406] [2019-12-27 03:01:04,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:04,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:01:04,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406507465] [2019-12-27 03:01:04,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:01:04,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:01:04,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:01:04,517 INFO L87 Difference]: Start difference. First operand 21155 states and 64148 transitions. Second operand 7 states. [2019-12-27 03:01:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:05,158 INFO L93 Difference]: Finished difference Result 60723 states and 180590 transitions. [2019-12-27 03:01:05,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:01:05,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:01:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:05,215 INFO L225 Difference]: With dead ends: 60723 [2019-12-27 03:01:05,215 INFO L226 Difference]: Without dead ends: 42175 [2019-12-27 03:01:05,216 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-27 03:01:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42175 states. [2019-12-27 03:01:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42175 to 24456. [2019-12-27 03:01:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24456 states. [2019-12-27 03:01:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24456 states to 24456 states and 73578 transitions. [2019-12-27 03:01:05,690 INFO L78 Accepts]: Start accepts. Automaton has 24456 states and 73578 transitions. Word has length 64 [2019-12-27 03:01:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:05,690 INFO L462 AbstractCegarLoop]: Abstraction has 24456 states and 73578 transitions. [2019-12-27 03:01:05,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:01:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 24456 states and 73578 transitions. [2019-12-27 03:01:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:05,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:05,714 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-27 03:01:05,714 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1864819808, now seen corresponding path program 3 times [2019-12-27 03:01:05,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:05,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442533988] [2019-12-27 03:01:05,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:05,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442533988] [2019-12-27 03:01:05,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:05,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:01:05,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671260708] [2019-12-27 03:01:05,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:01:05,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:01:05,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:05,852 INFO L87 Difference]: Start difference. First operand 24456 states and 73578 transitions. Second operand 9 states. [2019-12-27 03:01:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:07,221 INFO L93 Difference]: Finished difference Result 82000 states and 242893 transitions. [2019-12-27 03:01:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:01:07,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 03:01:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:07,335 INFO L225 Difference]: With dead ends: 82000 [2019-12-27 03:01:07,335 INFO L226 Difference]: Without dead ends: 78263 [2019-12-27 03:01:07,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:01:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78263 states. [2019-12-27 03:01:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78263 to 24486. [2019-12-27 03:01:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24486 states. [2019-12-27 03:01:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24486 states to 24486 states and 73706 transitions. [2019-12-27 03:01:08,408 INFO L78 Accepts]: Start accepts. Automaton has 24486 states and 73706 transitions. Word has length 64 [2019-12-27 03:01:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:08,408 INFO L462 AbstractCegarLoop]: Abstraction has 24486 states and 73706 transitions. [2019-12-27 03:01:08,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:01:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 24486 states and 73706 transitions. [2019-12-27 03:01:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:08,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:08,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:08,432 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:08,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1743895244, now seen corresponding path program 4 times [2019-12-27 03:01:08,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:08,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993329826] [2019-12-27 03:01:08,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:08,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993329826] [2019-12-27 03:01:08,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:08,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:01:08,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887428703] [2019-12-27 03:01:08,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:01:08,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:01:08,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:08,541 INFO L87 Difference]: Start difference. First operand 24486 states and 73706 transitions. Second operand 9 states. [2019-12-27 03:01:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:09,832 INFO L93 Difference]: Finished difference Result 98855 states and 292935 transitions. [2019-12-27 03:01:09,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:01:09,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 03:01:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:09,973 INFO L225 Difference]: With dead ends: 98855 [2019-12-27 03:01:09,973 INFO L226 Difference]: Without dead ends: 95231 [2019-12-27 03:01:09,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:01:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95231 states. [2019-12-27 03:01:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95231 to 24523. [2019-12-27 03:01:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24523 states. [2019-12-27 03:01:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24523 states to 24523 states and 73910 transitions. [2019-12-27 03:01:10,847 INFO L78 Accepts]: Start accepts. Automaton has 24523 states and 73910 transitions. Word has length 64 [2019-12-27 03:01:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:10,847 INFO L462 AbstractCegarLoop]: Abstraction has 24523 states and 73910 transitions. [2019-12-27 03:01:10,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:01:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 24523 states and 73910 transitions. [2019-12-27 03:01:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:11,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:11,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:11,152 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608434, now seen corresponding path program 5 times [2019-12-27 03:01:11,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:11,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16047509] [2019-12-27 03:01:11,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:11,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16047509] [2019-12-27 03:01:11,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:11,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:01:11,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239988971] [2019-12-27 03:01:11,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:01:11,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:01:11,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:01:11,228 INFO L87 Difference]: Start difference. First operand 24523 states and 73910 transitions. Second operand 7 states. [2019-12-27 03:01:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:11,860 INFO L93 Difference]: Finished difference Result 51563 states and 153345 transitions. [2019-12-27 03:01:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:01:11,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:01:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:11,966 INFO L225 Difference]: With dead ends: 51563 [2019-12-27 03:01:11,967 INFO L226 Difference]: Without dead ends: 44912 [2019-12-27 03:01:11,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-27 03:01:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44912 states. [2019-12-27 03:01:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44912 to 24831. [2019-12-27 03:01:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24831 states. [2019-12-27 03:01:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24831 states to 24831 states and 74861 transitions. [2019-12-27 03:01:12,754 INFO L78 Accepts]: Start accepts. Automaton has 24831 states and 74861 transitions. Word has length 64 [2019-12-27 03:01:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:12,754 INFO L462 AbstractCegarLoop]: Abstraction has 24831 states and 74861 transitions. [2019-12-27 03:01:12,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:01:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 24831 states and 74861 transitions. [2019-12-27 03:01:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:12,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:12,779 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-27 03:01:12,779 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:12,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:12,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2138548684, now seen corresponding path program 6 times [2019-12-27 03:01:12,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:12,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447557181] [2019-12-27 03:01:12,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:12,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447557181] [2019-12-27 03:01:12,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:12,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:01:12,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305909048] [2019-12-27 03:01:12,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:01:12,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:12,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:01:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:01:12,859 INFO L87 Difference]: Start difference. First operand 24831 states and 74861 transitions. Second operand 6 states. [2019-12-27 03:01:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:13,611 INFO L93 Difference]: Finished difference Result 40171 states and 119168 transitions. [2019-12-27 03:01:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:01:13,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 03:01:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:13,666 INFO L225 Difference]: With dead ends: 40171 [2019-12-27 03:01:13,666 INFO L226 Difference]: Without dead ends: 39968 [2019-12-27 03:01:13,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39968 states. [2019-12-27 03:01:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39968 to 26499. [2019-12-27 03:01:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26499 states. [2019-12-27 03:01:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26499 states to 26499 states and 80093 transitions. [2019-12-27 03:01:14,164 INFO L78 Accepts]: Start accepts. Automaton has 26499 states and 80093 transitions. Word has length 64 [2019-12-27 03:01:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:14,164 INFO L462 AbstractCegarLoop]: Abstraction has 26499 states and 80093 transitions. [2019-12-27 03:01:14,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:01:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 26499 states and 80093 transitions. [2019-12-27 03:01:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:14,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:14,193 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-27 03:01:14,193 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:14,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:14,194 INFO L82 PathProgramCache]: Analyzing trace with hash -203791434, now seen corresponding path program 7 times [2019-12-27 03:01:14,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:14,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755551566] [2019-12-27 03:01:14,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:14,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755551566] [2019-12-27 03:01:14,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:14,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:01:14,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010967264] [2019-12-27 03:01:14,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:14,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:14,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:14,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:14,288 INFO L87 Difference]: Start difference. First operand 26499 states and 80093 transitions. Second operand 5 states. [2019-12-27 03:01:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:14,823 INFO L93 Difference]: Finished difference Result 28511 states and 85751 transitions. [2019-12-27 03:01:14,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:01:14,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 03:01:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:14,861 INFO L225 Difference]: With dead ends: 28511 [2019-12-27 03:01:14,862 INFO L226 Difference]: Without dead ends: 28511 [2019-12-27 03:01:14,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:01:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28511 states. [2019-12-27 03:01:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28511 to 26924. [2019-12-27 03:01:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26924 states. [2019-12-27 03:01:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26924 states to 26924 states and 81409 transitions. [2019-12-27 03:01:15,282 INFO L78 Accepts]: Start accepts. Automaton has 26924 states and 81409 transitions. Word has length 64 [2019-12-27 03:01:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:15,283 INFO L462 AbstractCegarLoop]: Abstraction has 26924 states and 81409 transitions. [2019-12-27 03:01:15,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 26924 states and 81409 transitions. [2019-12-27 03:01:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:15,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:15,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:15,323 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:15,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1288865556, now seen corresponding path program 8 times [2019-12-27 03:01:15,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:15,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005663912] [2019-12-27 03:01:15,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:15,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005663912] [2019-12-27 03:01:15,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:15,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:01:15,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131355654] [2019-12-27 03:01:15,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:01:15,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:15,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:01:15,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:15,472 INFO L87 Difference]: Start difference. First operand 26924 states and 81409 transitions. Second operand 9 states. [2019-12-27 03:01:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:17,451 INFO L93 Difference]: Finished difference Result 43600 states and 128179 transitions. [2019-12-27 03:01:17,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:01:17,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 03:01:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:17,514 INFO L225 Difference]: With dead ends: 43600 [2019-12-27 03:01:17,514 INFO L226 Difference]: Without dead ends: 43304 [2019-12-27 03:01:17,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:01:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43304 states. [2019-12-27 03:01:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43304 to 27220. [2019-12-27 03:01:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27220 states. [2019-12-27 03:01:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27220 states to 27220 states and 82366 transitions. [2019-12-27 03:01:18,082 INFO L78 Accepts]: Start accepts. Automaton has 27220 states and 82366 transitions. Word has length 64 [2019-12-27 03:01:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:18,082 INFO L462 AbstractCegarLoop]: Abstraction has 27220 states and 82366 transitions. [2019-12-27 03:01:18,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:01:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 27220 states and 82366 transitions. [2019-12-27 03:01:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:18,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:18,111 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-27 03:01:18,111 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2115336524, now seen corresponding path program 9 times [2019-12-27 03:01:18,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:18,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530573528] [2019-12-27 03:01:18,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:18,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530573528] [2019-12-27 03:01:18,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:18,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:01:18,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766572613] [2019-12-27 03:01:18,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:01:18,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:18,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:01:18,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:01:18,197 INFO L87 Difference]: Start difference. First operand 27220 states and 82366 transitions. Second operand 7 states. [2019-12-27 03:01:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:19,433 INFO L93 Difference]: Finished difference Result 39161 states and 118278 transitions. [2019-12-27 03:01:19,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 03:01:19,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 03:01:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:19,491 INFO L225 Difference]: With dead ends: 39161 [2019-12-27 03:01:19,491 INFO L226 Difference]: Without dead ends: 39161 [2019-12-27 03:01:19,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:01:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39161 states. [2019-12-27 03:01:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39161 to 26999. [2019-12-27 03:01:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26999 states. [2019-12-27 03:01:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26999 states to 26999 states and 81718 transitions. [2019-12-27 03:01:19,978 INFO L78 Accepts]: Start accepts. Automaton has 26999 states and 81718 transitions. Word has length 64 [2019-12-27 03:01:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:19,978 INFO L462 AbstractCegarLoop]: Abstraction has 26999 states and 81718 transitions. [2019-12-27 03:01:19,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:01:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 26999 states and 81718 transitions. [2019-12-27 03:01:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:20,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:20,008 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-27 03:01:20,008 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash 576481680, now seen corresponding path program 10 times [2019-12-27 03:01:20,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:20,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033050516] [2019-12-27 03:01:20,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:20,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033050516] [2019-12-27 03:01:20,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:20,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:01:20,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255567327] [2019-12-27 03:01:20,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:01:20,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:01:20,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:01:20,079 INFO L87 Difference]: Start difference. First operand 26999 states and 81718 transitions. Second operand 5 states. [2019-12-27 03:01:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:20,680 INFO L93 Difference]: Finished difference Result 38088 states and 112998 transitions. [2019-12-27 03:01:20,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:01:20,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 03:01:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:20,736 INFO L225 Difference]: With dead ends: 38088 [2019-12-27 03:01:20,736 INFO L226 Difference]: Without dead ends: 37868 [2019-12-27 03:01:20,736 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-27 03:01:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37868 states. [2019-12-27 03:01:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37868 to 32230. [2019-12-27 03:01:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32230 states. [2019-12-27 03:01:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32230 states to 32230 states and 96827 transitions. [2019-12-27 03:01:21,247 INFO L78 Accepts]: Start accepts. Automaton has 32230 states and 96827 transitions. Word has length 64 [2019-12-27 03:01:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:21,248 INFO L462 AbstractCegarLoop]: Abstraction has 32230 states and 96827 transitions. [2019-12-27 03:01:21,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:01:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 32230 states and 96827 transitions. [2019-12-27 03:01:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:21,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:21,279 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-27 03:01:21,280 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash 883747876, now seen corresponding path program 11 times [2019-12-27 03:01:21,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:21,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930504087] [2019-12-27 03:01:21,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:21,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930504087] [2019-12-27 03:01:21,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:21,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:01:21,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669486841] [2019-12-27 03:01:21,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:01:21,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:01:21,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:01:21,381 INFO L87 Difference]: Start difference. First operand 32230 states and 96827 transitions. Second operand 6 states. [2019-12-27 03:01:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:22,291 INFO L93 Difference]: Finished difference Result 37761 states and 112147 transitions. [2019-12-27 03:01:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:01:22,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 03:01:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:22,339 INFO L225 Difference]: With dead ends: 37761 [2019-12-27 03:01:22,339 INFO L226 Difference]: Without dead ends: 37761 [2019-12-27 03:01:22,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37761 states. [2019-12-27 03:01:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37761 to 29801. [2019-12-27 03:01:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29801 states. [2019-12-27 03:01:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29801 states to 29801 states and 89901 transitions. [2019-12-27 03:01:22,806 INFO L78 Accepts]: Start accepts. Automaton has 29801 states and 89901 transitions. Word has length 64 [2019-12-27 03:01:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:22,806 INFO L462 AbstractCegarLoop]: Abstraction has 29801 states and 89901 transitions. [2019-12-27 03:01:22,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:01:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 29801 states and 89901 transitions. [2019-12-27 03:01:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:22,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:22,839 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-27 03:01:22,839 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:22,839 INFO L82 PathProgramCache]: Analyzing trace with hash 81413226, now seen corresponding path program 12 times [2019-12-27 03:01:22,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:22,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739238966] [2019-12-27 03:01:22,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:22,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739238966] [2019-12-27 03:01:22,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:22,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:01:22,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716336768] [2019-12-27 03:01:22,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:01:22,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:22,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:01:22,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:01:22,945 INFO L87 Difference]: Start difference. First operand 29801 states and 89901 transitions. Second operand 8 states. [2019-12-27 03:01:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:24,457 INFO L93 Difference]: Finished difference Result 43438 states and 130535 transitions. [2019-12-27 03:01:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 03:01:24,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 03:01:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:24,517 INFO L225 Difference]: With dead ends: 43438 [2019-12-27 03:01:24,517 INFO L226 Difference]: Without dead ends: 43438 [2019-12-27 03:01:24,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:01:24,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43438 states. [2019-12-27 03:01:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43438 to 30110. [2019-12-27 03:01:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30110 states. [2019-12-27 03:01:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30110 states to 30110 states and 90814 transitions. [2019-12-27 03:01:25,042 INFO L78 Accepts]: Start accepts. Automaton has 30110 states and 90814 transitions. Word has length 64 [2019-12-27 03:01:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:25,042 INFO L462 AbstractCegarLoop]: Abstraction has 30110 states and 90814 transitions. [2019-12-27 03:01:25,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:01:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30110 states and 90814 transitions. [2019-12-27 03:01:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 03:01:25,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:25,072 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-27 03:01:25,072 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:25,072 INFO L82 PathProgramCache]: Analyzing trace with hash 871311026, now seen corresponding path program 13 times [2019-12-27 03:01:25,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:25,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426797798] [2019-12-27 03:01:25,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:25,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426797798] [2019-12-27 03:01:25,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:25,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:25,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850745415] [2019-12-27 03:01:25,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:25,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:25,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:25,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:25,134 INFO L87 Difference]: Start difference. First operand 30110 states and 90814 transitions. Second operand 3 states. [2019-12-27 03:01:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:25,278 INFO L93 Difference]: Finished difference Result 30110 states and 90813 transitions. [2019-12-27 03:01:25,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:25,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 03:01:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:25,352 INFO L225 Difference]: With dead ends: 30110 [2019-12-27 03:01:25,353 INFO L226 Difference]: Without dead ends: 30110 [2019-12-27 03:01:25,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30110 states. [2019-12-27 03:01:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30110 to 27230. [2019-12-27 03:01:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27230 states. [2019-12-27 03:01:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27230 states to 27230 states and 82668 transitions. [2019-12-27 03:01:26,317 INFO L78 Accepts]: Start accepts. Automaton has 27230 states and 82668 transitions. Word has length 64 [2019-12-27 03:01:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:26,318 INFO L462 AbstractCegarLoop]: Abstraction has 27230 states and 82668 transitions. [2019-12-27 03:01:26,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27230 states and 82668 transitions. [2019-12-27 03:01:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:01:26,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:26,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:26,370 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:26,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash 112305005, now seen corresponding path program 1 times [2019-12-27 03:01:26,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:26,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35924499] [2019-12-27 03:01:26,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:26,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35924499] [2019-12-27 03:01:26,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:26,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:01:26,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316962280] [2019-12-27 03:01:26,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:01:26,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:01:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:26,471 INFO L87 Difference]: Start difference. First operand 27230 states and 82668 transitions. Second operand 3 states. [2019-12-27 03:01:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:26,554 INFO L93 Difference]: Finished difference Result 20768 states and 62190 transitions. [2019-12-27 03:01:26,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:01:26,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:01:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:26,581 INFO L225 Difference]: With dead ends: 20768 [2019-12-27 03:01:26,581 INFO L226 Difference]: Without dead ends: 20768 [2019-12-27 03:01:26,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:01:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20768 states. [2019-12-27 03:01:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20768 to 19928. [2019-12-27 03:01:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19928 states. [2019-12-27 03:01:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19928 states to 19928 states and 59623 transitions. [2019-12-27 03:01:26,861 INFO L78 Accepts]: Start accepts. Automaton has 19928 states and 59623 transitions. Word has length 65 [2019-12-27 03:01:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:26,861 INFO L462 AbstractCegarLoop]: Abstraction has 19928 states and 59623 transitions. [2019-12-27 03:01:26,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:01:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 19928 states and 59623 transitions. [2019-12-27 03:01:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:01:26,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:26,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:26,882 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:26,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash -424379593, now seen corresponding path program 1 times [2019-12-27 03:01:26,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:26,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191301639] [2019-12-27 03:01:26,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:26,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191301639] [2019-12-27 03:01:26,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:26,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:01:26,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663020582] [2019-12-27 03:01:26,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:01:26,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:01:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:01:26,989 INFO L87 Difference]: Start difference. First operand 19928 states and 59623 transitions. Second operand 8 states. [2019-12-27 03:01:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:28,506 INFO L93 Difference]: Finished difference Result 28961 states and 85629 transitions. [2019-12-27 03:01:28,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 03:01:28,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 03:01:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:28,545 INFO L225 Difference]: With dead ends: 28961 [2019-12-27 03:01:28,545 INFO L226 Difference]: Without dead ends: 28961 [2019-12-27 03:01:28,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:01:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28961 states. [2019-12-27 03:01:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28961 to 20669. [2019-12-27 03:01:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20669 states. [2019-12-27 03:01:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20669 states to 20669 states and 61976 transitions. [2019-12-27 03:01:28,906 INFO L78 Accepts]: Start accepts. Automaton has 20669 states and 61976 transitions. Word has length 66 [2019-12-27 03:01:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:28,906 INFO L462 AbstractCegarLoop]: Abstraction has 20669 states and 61976 transitions. [2019-12-27 03:01:28,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:01:28,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20669 states and 61976 transitions. [2019-12-27 03:01:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:01:28,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:28,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:28,929 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1525087521, now seen corresponding path program 2 times [2019-12-27 03:01:28,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:28,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387600995] [2019-12-27 03:01:28,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:29,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387600995] [2019-12-27 03:01:29,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:29,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:01:29,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620207681] [2019-12-27 03:01:29,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:01:29,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:29,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:01:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:01:29,402 INFO L87 Difference]: Start difference. First operand 20669 states and 61976 transitions. Second operand 14 states. [2019-12-27 03:01:30,315 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-27 03:01:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:34,347 INFO L93 Difference]: Finished difference Result 53040 states and 156869 transitions. [2019-12-27 03:01:34,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 03:01:34,348 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 03:01:34,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:34,405 INFO L225 Difference]: With dead ends: 53040 [2019-12-27 03:01:34,405 INFO L226 Difference]: Without dead ends: 40289 [2019-12-27 03:01:34,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=577, Invalid=2963, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 03:01:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40289 states. [2019-12-27 03:01:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40289 to 20990. [2019-12-27 03:01:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20990 states. [2019-12-27 03:01:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20990 states to 20990 states and 62563 transitions. [2019-12-27 03:01:34,835 INFO L78 Accepts]: Start accepts. Automaton has 20990 states and 62563 transitions. Word has length 66 [2019-12-27 03:01:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:34,835 INFO L462 AbstractCegarLoop]: Abstraction has 20990 states and 62563 transitions. [2019-12-27 03:01:34,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:01:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 20990 states and 62563 transitions. [2019-12-27 03:01:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:01:34,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:34,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:34,856 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1075104663, now seen corresponding path program 3 times [2019-12-27 03:01:34,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:34,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534702863] [2019-12-27 03:01:34,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:34,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534702863] [2019-12-27 03:01:34,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:34,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:01:34,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501926129] [2019-12-27 03:01:34,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:01:34,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:01:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:01:34,968 INFO L87 Difference]: Start difference. First operand 20990 states and 62563 transitions. Second operand 9 states. [2019-12-27 03:01:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:36,397 INFO L93 Difference]: Finished difference Result 38467 states and 114352 transitions. [2019-12-27 03:01:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:01:36,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 03:01:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:36,443 INFO L225 Difference]: With dead ends: 38467 [2019-12-27 03:01:36,444 INFO L226 Difference]: Without dead ends: 32575 [2019-12-27 03:01:36,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:01:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32575 states. [2019-12-27 03:01:36,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32575 to 20982. [2019-12-27 03:01:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20982 states. [2019-12-27 03:01:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20982 states to 20982 states and 62435 transitions. [2019-12-27 03:01:37,016 INFO L78 Accepts]: Start accepts. Automaton has 20982 states and 62435 transitions. Word has length 66 [2019-12-27 03:01:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:37,017 INFO L462 AbstractCegarLoop]: Abstraction has 20982 states and 62435 transitions. [2019-12-27 03:01:37,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:01:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20982 states and 62435 transitions. [2019-12-27 03:01:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:01:37,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:37,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:37,037 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:37,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1891113935, now seen corresponding path program 4 times [2019-12-27 03:01:37,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:37,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027350266] [2019-12-27 03:01:37,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:37,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027350266] [2019-12-27 03:01:37,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:37,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:01:37,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725791460] [2019-12-27 03:01:37,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:01:37,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:37,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:01:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:01:37,500 INFO L87 Difference]: Start difference. First operand 20982 states and 62435 transitions. Second operand 16 states. [2019-12-27 03:01:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:43,647 INFO L93 Difference]: Finished difference Result 34142 states and 101876 transitions. [2019-12-27 03:01:43,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 03:01:43,647 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 03:01:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:43,694 INFO L225 Difference]: With dead ends: 34142 [2019-12-27 03:01:43,695 INFO L226 Difference]: Without dead ends: 33207 [2019-12-27 03:01:43,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=685, Invalid=3871, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 03:01:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33207 states. [2019-12-27 03:01:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33207 to 21264. [2019-12-27 03:01:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21264 states. [2019-12-27 03:01:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21264 states to 21264 states and 63226 transitions. [2019-12-27 03:01:44,100 INFO L78 Accepts]: Start accepts. Automaton has 21264 states and 63226 transitions. Word has length 66 [2019-12-27 03:01:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:44,100 INFO L462 AbstractCegarLoop]: Abstraction has 21264 states and 63226 transitions. [2019-12-27 03:01:44,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:01:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21264 states and 63226 transitions. [2019-12-27 03:01:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:01:44,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:44,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:44,125 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:44,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1992483747, now seen corresponding path program 5 times [2019-12-27 03:01:44,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:44,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661361434] [2019-12-27 03:01:44,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:44,564 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 9 [2019-12-27 03:01:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:44,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661361434] [2019-12-27 03:01:44,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:44,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:01:44,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279901478] [2019-12-27 03:01:44,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:01:44,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:44,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:01:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:01:44,713 INFO L87 Difference]: Start difference. First operand 21264 states and 63226 transitions. Second operand 16 states. [2019-12-27 03:01:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:51,104 INFO L93 Difference]: Finished difference Result 32077 states and 96382 transitions. [2019-12-27 03:01:51,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-27 03:01:51,105 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 03:01:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:51,150 INFO L225 Difference]: With dead ends: 32077 [2019-12-27 03:01:51,150 INFO L226 Difference]: Without dead ends: 31398 [2019-12-27 03:01:51,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=637, Invalid=4193, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 03:01:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31398 states. [2019-12-27 03:01:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31398 to 21429. [2019-12-27 03:01:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21429 states. [2019-12-27 03:01:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21429 states to 21429 states and 63751 transitions. [2019-12-27 03:01:51,534 INFO L78 Accepts]: Start accepts. Automaton has 21429 states and 63751 transitions. Word has length 66 [2019-12-27 03:01:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:51,534 INFO L462 AbstractCegarLoop]: Abstraction has 21429 states and 63751 transitions. [2019-12-27 03:01:51,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:01:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 21429 states and 63751 transitions. [2019-12-27 03:01:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:01:51,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:51,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:51,559 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1603540287, now seen corresponding path program 6 times [2019-12-27 03:01:51,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:51,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954738452] [2019-12-27 03:01:51,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:51,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954738452] [2019-12-27 03:01:51,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:51,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:01:51,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319207203] [2019-12-27 03:01:51,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:01:51,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:01:51,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:01:51,939 INFO L87 Difference]: Start difference. First operand 21429 states and 63751 transitions. Second operand 16 states. [2019-12-27 03:01:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:01:58,338 INFO L93 Difference]: Finished difference Result 32130 states and 96163 transitions. [2019-12-27 03:01:58,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 03:01:58,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 03:01:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:01:58,385 INFO L225 Difference]: With dead ends: 32130 [2019-12-27 03:01:58,385 INFO L226 Difference]: Without dead ends: 32021 [2019-12-27 03:01:58,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=640, Invalid=3916, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 03:01:58,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32021 states. [2019-12-27 03:01:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32021 to 21012. [2019-12-27 03:01:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21012 states. [2019-12-27 03:01:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21012 states to 21012 states and 62521 transitions. [2019-12-27 03:01:58,775 INFO L78 Accepts]: Start accepts. Automaton has 21012 states and 62521 transitions. Word has length 66 [2019-12-27 03:01:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:01:58,775 INFO L462 AbstractCegarLoop]: Abstraction has 21012 states and 62521 transitions. [2019-12-27 03:01:58,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:01:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21012 states and 62521 transitions. [2019-12-27 03:01:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:01:58,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:01:58,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:01:58,801 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:01:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:01:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -757566657, now seen corresponding path program 7 times [2019-12-27 03:01:58,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:01:58,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305980862] [2019-12-27 03:01:58,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:01:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:01:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:01:58,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305980862] [2019-12-27 03:01:58,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:01:58,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:01:58,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553975960] [2019-12-27 03:01:58,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:01:58,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:01:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:01:58,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:01:58,948 INFO L87 Difference]: Start difference. First operand 21012 states and 62521 transitions. Second operand 11 states. [2019-12-27 03:02:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:00,113 INFO L93 Difference]: Finished difference Result 42972 states and 127977 transitions. [2019-12-27 03:02:00,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 03:02:00,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 03:02:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:00,180 INFO L225 Difference]: With dead ends: 42972 [2019-12-27 03:02:00,180 INFO L226 Difference]: Without dead ends: 35718 [2019-12-27 03:02:00,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2019-12-27 03:02:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35718 states. [2019-12-27 03:02:00,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35718 to 20480. [2019-12-27 03:02:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20480 states. [2019-12-27 03:02:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20480 states to 20480 states and 60980 transitions. [2019-12-27 03:02:00,728 INFO L78 Accepts]: Start accepts. Automaton has 20480 states and 60980 transitions. Word has length 66 [2019-12-27 03:02:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:00,728 INFO L462 AbstractCegarLoop]: Abstraction has 20480 states and 60980 transitions. [2019-12-27 03:02:00,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:02:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20480 states and 60980 transitions. [2019-12-27 03:02:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:02:00,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:00,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:00,748 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash 103775479, now seen corresponding path program 8 times [2019-12-27 03:02:00,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:00,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813310289] [2019-12-27 03:02:00,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:00,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813310289] [2019-12-27 03:02:00,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:00,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:02:00,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907837587] [2019-12-27 03:02:00,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:02:00,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:02:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:02:00,944 INFO L87 Difference]: Start difference. First operand 20480 states and 60980 transitions. Second operand 11 states. [2019-12-27 03:02:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:03,517 INFO L93 Difference]: Finished difference Result 33353 states and 97262 transitions. [2019-12-27 03:02:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:02:03,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 03:02:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:03,561 INFO L225 Difference]: With dead ends: 33353 [2019-12-27 03:02:03,561 INFO L226 Difference]: Without dead ends: 33353 [2019-12-27 03:02:03,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:02:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33353 states. [2019-12-27 03:02:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33353 to 19470. [2019-12-27 03:02:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19470 states. [2019-12-27 03:02:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19470 states to 19470 states and 57574 transitions. [2019-12-27 03:02:03,928 INFO L78 Accepts]: Start accepts. Automaton has 19470 states and 57574 transitions. Word has length 66 [2019-12-27 03:02:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:03,928 INFO L462 AbstractCegarLoop]: Abstraction has 19470 states and 57574 transitions. [2019-12-27 03:02:03,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:02:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19470 states and 57574 transitions. [2019-12-27 03:02:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:02:03,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:03,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:03,946 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:03,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash 328971281, now seen corresponding path program 9 times [2019-12-27 03:02:03,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:03,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77458969] [2019-12-27 03:02:03,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:04,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77458969] [2019-12-27 03:02:04,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:04,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:02:04,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185899036] [2019-12-27 03:02:04,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:02:04,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:02:04,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:02:04,025 INFO L87 Difference]: Start difference. First operand 19470 states and 57574 transitions. Second operand 5 states. [2019-12-27 03:02:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:04,173 INFO L93 Difference]: Finished difference Result 22880 states and 67742 transitions. [2019-12-27 03:02:04,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:02:04,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 03:02:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:04,219 INFO L225 Difference]: With dead ends: 22880 [2019-12-27 03:02:04,220 INFO L226 Difference]: Without dead ends: 22880 [2019-12-27 03:02:04,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:02:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22880 states. [2019-12-27 03:02:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22880 to 17634. [2019-12-27 03:02:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17634 states. [2019-12-27 03:02:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17634 states to 17634 states and 52475 transitions. [2019-12-27 03:02:04,529 INFO L78 Accepts]: Start accepts. Automaton has 17634 states and 52475 transitions. Word has length 66 [2019-12-27 03:02:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:04,529 INFO L462 AbstractCegarLoop]: Abstraction has 17634 states and 52475 transitions. [2019-12-27 03:02:04,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:02:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 17634 states and 52475 transitions. [2019-12-27 03:02:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:02:04,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:04,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:04,546 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1945562630, now seen corresponding path program 1 times [2019-12-27 03:02:04,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:04,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122212193] [2019-12-27 03:02:04,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:04,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122212193] [2019-12-27 03:02:04,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:04,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:02:04,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636870540] [2019-12-27 03:02:04,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:02:04,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:04,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:02:04,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:02:04,780 INFO L87 Difference]: Start difference. First operand 17634 states and 52475 transitions. Second operand 12 states. [2019-12-27 03:02:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:05,856 INFO L93 Difference]: Finished difference Result 31176 states and 93313 transitions. [2019-12-27 03:02:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:02:05,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 03:02:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:05,900 INFO L225 Difference]: With dead ends: 31176 [2019-12-27 03:02:05,901 INFO L226 Difference]: Without dead ends: 30735 [2019-12-27 03:02:05,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:02:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30735 states. [2019-12-27 03:02:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30735 to 17380. [2019-12-27 03:02:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17380 states. [2019-12-27 03:02:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17380 states to 17380 states and 51831 transitions. [2019-12-27 03:02:06,344 INFO L78 Accepts]: Start accepts. Automaton has 17380 states and 51831 transitions. Word has length 67 [2019-12-27 03:02:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:06,344 INFO L462 AbstractCegarLoop]: Abstraction has 17380 states and 51831 transitions. [2019-12-27 03:02:06,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:02:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 17380 states and 51831 transitions. [2019-12-27 03:02:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:02:06,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:06,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:06,360 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:06,361 INFO L82 PathProgramCache]: Analyzing trace with hash 121505500, now seen corresponding path program 2 times [2019-12-27 03:02:06,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:06,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146315321] [2019-12-27 03:02:06,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:06,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146315321] [2019-12-27 03:02:06,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:06,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:02:06,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756337395] [2019-12-27 03:02:06,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:02:06,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:02:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:02:06,476 INFO L87 Difference]: Start difference. First operand 17380 states and 51831 transitions. Second operand 9 states. [2019-12-27 03:02:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:08,343 INFO L93 Difference]: Finished difference Result 28727 states and 84178 transitions. [2019-12-27 03:02:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:02:08,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 03:02:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:08,383 INFO L225 Difference]: With dead ends: 28727 [2019-12-27 03:02:08,383 INFO L226 Difference]: Without dead ends: 28727 [2019-12-27 03:02:08,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-27 03:02:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28727 states. [2019-12-27 03:02:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28727 to 18842. [2019-12-27 03:02:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18842 states. [2019-12-27 03:02:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18842 states to 18842 states and 56077 transitions. [2019-12-27 03:02:08,718 INFO L78 Accepts]: Start accepts. Automaton has 18842 states and 56077 transitions. Word has length 67 [2019-12-27 03:02:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:08,718 INFO L462 AbstractCegarLoop]: Abstraction has 18842 states and 56077 transitions. [2019-12-27 03:02:08,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:02:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 18842 states and 56077 transitions. [2019-12-27 03:02:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:02:08,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:08,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:08,736 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash 190726530, now seen corresponding path program 3 times [2019-12-27 03:02:08,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:08,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902146799] [2019-12-27 03:02:08,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:02:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:02:08,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902146799] [2019-12-27 03:02:08,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:02:08,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:02:08,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307925357] [2019-12-27 03:02:08,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:02:08,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:02:08,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:02:08,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:02:08,812 INFO L87 Difference]: Start difference. First operand 18842 states and 56077 transitions. Second operand 5 states. [2019-12-27 03:02:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:02:08,990 INFO L93 Difference]: Finished difference Result 18726 states and 55463 transitions. [2019-12-27 03:02:08,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:02:08,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 03:02:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:02:09,031 INFO L225 Difference]: With dead ends: 18726 [2019-12-27 03:02:09,031 INFO L226 Difference]: Without dead ends: 18726 [2019-12-27 03:02:09,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:02:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18726 states. [2019-12-27 03:02:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18726 to 16738. [2019-12-27 03:02:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16738 states. [2019-12-27 03:02:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16738 states to 16738 states and 49511 transitions. [2019-12-27 03:02:09,427 INFO L78 Accepts]: Start accepts. Automaton has 16738 states and 49511 transitions. Word has length 67 [2019-12-27 03:02:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:02:09,428 INFO L462 AbstractCegarLoop]: Abstraction has 16738 states and 49511 transitions. [2019-12-27 03:02:09,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:02:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 16738 states and 49511 transitions. [2019-12-27 03:02:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:02:09,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:02:09,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:02:09,445 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:02:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:02:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash -778064925, now seen corresponding path program 1 times [2019-12-27 03:02:09,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:02:09,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701702886] [2019-12-27 03:02:09,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:02:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:02:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:02:09,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:02:09,558 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:02:09,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~z$r_buff0_thd0~0_144 0) (= v_~z$r_buff0_thd1~0_230 0) (= v_~z$w_buff0_used~0_947 0) (= v_~z$r_buff1_thd1~0_185 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_563 0) (= v_~weak$$choice2~0_147 0) (= 0 v_~z$r_buff1_thd3~0_352) (= 0 v_~x~0_159) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= v_~z$mem_tmp~0_24 0) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_44| 1)) (= v_~z$r_buff0_thd2~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_44| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_44|) |v_ULTIMATE.start_main_~#t1489~0.offset_28| 0)) |v_#memory_int_19|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_155 0) (= |v_ULTIMATE.start_main_~#t1489~0.offset_28| 0) (= v_~z$r_buff1_thd2~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_44|)) (= 0 v_~z$r_buff0_thd3~0_371) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1489~0.base_44|) (= v_~main$tmp_guard1~0_38 0) (= v_~z$r_buff1_thd0~0_199 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1489~0.base_44| 4) |v_#length_21|) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_19) (= v_~z$w_buff1~0_328 0) (= v_~z~0_152 0) (= v_~z$w_buff0~0_540 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$flush_delayed~0_35) (= v_~y~0_49 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_44|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_201, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_59|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_328, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_37|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_99|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_75|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_199, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_126, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_25|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_~#t1489~0.base=|v_ULTIMATE.start_main_~#t1489~0.base_44|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_947, ~z$w_buff0~0=v_~z$w_buff0~0_540, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_352, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_563, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_18|, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t1489~0.offset=|v_ULTIMATE.start_main_~#t1489~0.offset_28|, #NULL.base=|v_#NULL.base_7|, ~weak$$choice0~0=v_~weak$$choice0~0_19, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_80|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_185, #memory_int=|v_#memory_int_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_152, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_230, ~x~0=v_~x~0_159} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, 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_~#t1491~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1489~0.base, 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, ULTIMATE.start_main_~#t1491~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1489~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1490~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 03:02:09,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1490~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13|) |v_ULTIMATE.start_main_~#t1490~0.offset_11| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1490~0.base_13| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t1490~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t1490~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1490~0.offset, #length] because there is no mapped edge [2019-12-27 03:02:09,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1491~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1491~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13|) |v_ULTIMATE.start_main_~#t1491~0.offset_11| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1491~0.offset_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_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1491~0.offset, #length, ULTIMATE.start_main_~#t1491~0.base] because there is no mapped edge [2019-12-27 03:02:09,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_163 v_~z$w_buff1_used~0_112) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= v_~z$w_buff0~0_38 v_~z$w_buff1~0_37) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_14|) (= v_~z$w_buff0_used~0_162 1) (= 1 v_~z$w_buff0~0_37) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_14|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= (mod v_~z$w_buff1_used~0_112 256) 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_38, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_162, ~z$w_buff0~0=v_~z$w_buff0~0_37, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|, ~z$w_buff1~0=v_~z$w_buff1~0_37, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 03:02:09,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1663860176 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out1663860176| ~z$w_buff0~0_In1663860176) (= |P2Thread1of1ForFork2_#t~ite21_Out1663860176| |P2Thread1of1ForFork2_#t~ite20_Out1663860176|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1663860176 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1663860176 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1663860176 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1663860176 256) 0))))) (and (= |P2Thread1of1ForFork2_#t~ite20_In1663860176| |P2Thread1of1ForFork2_#t~ite20_Out1663860176|) (= |P2Thread1of1ForFork2_#t~ite21_Out1663860176| ~z$w_buff0~0_In1663860176) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1663860176, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1663860176, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In1663860176|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1663860176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1663860176, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1663860176, ~weak$$choice2~0=~weak$$choice2~0_In1663860176} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1663860176, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1663860176|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1663860176, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out1663860176|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1663860176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1663860176, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1663860176, ~weak$$choice2~0=~weak$$choice2~0_In1663860176} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 03:02:09,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1604468624 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1604468624 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1604468624| |P1Thread1of1ForFork1_#t~ite10_Out-1604468624|))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1604468624| ~z~0_In-1604468624) (or .cse0 .cse1) .cse2) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-1604468624| ~z$w_buff1~0_In-1604468624) (not .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1604468624, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1604468624, ~z$w_buff1~0=~z$w_buff1~0_In-1604468624, ~z~0=~z~0_In-1604468624} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1604468624|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1604468624, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1604468624, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1604468624|, ~z$w_buff1~0=~z$w_buff1~0_In-1604468624, ~z~0=~z~0_In-1604468624} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 03:02:09,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1897048059 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1897048059 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1897048059| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1897048059| ~z$w_buff0_used~0_In1897048059) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1897048059, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1897048059} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1897048059|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1897048059, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1897048059} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:02:09,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In861574684 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In861574684 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In861574684 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In861574684 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In861574684 |P0Thread1of1ForFork0_#t~ite6_Out861574684|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out861574684|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In861574684, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In861574684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861574684, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In861574684} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out861574684|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In861574684, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In861574684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861574684, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In861574684} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:02:09,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1365800527 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1365800527 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1365800527) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In1365800527 ~z$r_buff0_thd1~0_Out1365800527) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1365800527, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1365800527} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1365800527, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1365800527|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1365800527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:02:09,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In133526074 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In133526074 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out133526074| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out133526074| ~z$w_buff0_used~0_In133526074)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In133526074, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In133526074} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In133526074, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out133526074|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In133526074} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:02:09,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1999424992 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1999424992 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1999424992 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1999424992 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1999424992 |P1Thread1of1ForFork1_#t~ite12_Out-1999424992|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1999424992|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1999424992, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1999424992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1999424992, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1999424992} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1999424992, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1999424992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1999424992, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1999424992|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1999424992} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:02:09,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1598372066 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1598372066 256)))) (or (and (= ~z$r_buff0_thd2~0_In-1598372066 |P1Thread1of1ForFork1_#t~ite13_Out-1598372066|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1598372066|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1598372066, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1598372066} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1598372066, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1598372066|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1598372066} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:02:09,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1449850179 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1449850179 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1449850179 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1449850179 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1449850179|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out1449850179| ~z$r_buff1_thd2~0_In1449850179) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1449850179, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1449850179, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1449850179, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1449850179} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1449850179, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1449850179, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1449850179, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1449850179|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1449850179} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:02:09,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_92) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, 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-27 03:02:09,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff0_thd3~0_136) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_12|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 03:02:09,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In157370137 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite35_In157370137| |P2Thread1of1ForFork2_#t~ite35_Out157370137|) (= |P2Thread1of1ForFork2_#t~ite36_Out157370137| ~z$r_buff1_thd3~0_In157370137)) (and (= |P2Thread1of1ForFork2_#t~ite36_Out157370137| |P2Thread1of1ForFork2_#t~ite35_Out157370137|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In157370137 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In157370137 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In157370137 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In157370137 256)))) (= |P2Thread1of1ForFork2_#t~ite35_Out157370137| ~z$r_buff1_thd3~0_In157370137)))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In157370137|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In157370137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In157370137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In157370137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In157370137, ~weak$$choice2~0=~weak$$choice2~0_In157370137} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out157370137|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out157370137|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In157370137, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In157370137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In157370137, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In157370137, ~weak$$choice2~0=~weak$$choice2~0_In157370137} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 03:02:09,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_62 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_62} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 03:02:09,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out1606246009| |P2Thread1of1ForFork2_#t~ite39_Out1606246009|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1606246009 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1606246009 256) 0))) (or (and (not .cse0) .cse1 (= |P2Thread1of1ForFork2_#t~ite38_Out1606246009| ~z$w_buff1~0_In1606246009) (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out1606246009| ~z~0_In1606246009)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1606246009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1606246009, ~z$w_buff1~0=~z$w_buff1~0_In1606246009, ~z~0=~z~0_In1606246009} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1606246009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1606246009, ~z$w_buff1~0=~z$w_buff1~0_In1606246009, ~z~0=~z~0_In1606246009, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1606246009|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1606246009|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 03:02:09,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2068831924 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2068831924 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-2068831924| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite40_Out-2068831924| ~z$w_buff0_used~0_In-2068831924) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2068831924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2068831924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2068831924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2068831924, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-2068831924|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 03:02:09,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1602454818 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1602454818 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1602454818 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1602454818 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite41_Out1602454818| ~z$w_buff1_used~0_In1602454818)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out1602454818| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1602454818, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1602454818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1602454818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1602454818} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1602454818|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1602454818, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1602454818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1602454818, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1602454818} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 03:02:09,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1038415401 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1038415401 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-1038415401| ~z$r_buff0_thd3~0_In-1038415401) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-1038415401| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1038415401, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1038415401} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1038415401|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1038415401, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1038415401} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 03:02:09,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1382179716 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1382179716 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1382179716 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1382179716 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out1382179716| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1382179716 |P2Thread1of1ForFork2_#t~ite43_Out1382179716|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1382179716, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1382179716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382179716, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1382179716} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1382179716, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1382179716, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1382179716|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1382179716, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1382179716} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 03:02:09,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_167 |v_P2Thread1of1ForFork2_#t~ite43_40|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_167, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_39|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, 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-27 03:02:09,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In163726515 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In163726515 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In163726515 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In163726515 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out163726515| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out163726515| ~z$r_buff1_thd1~0_In163726515)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In163726515, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In163726515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In163726515, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In163726515} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In163726515, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out163726515|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In163726515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In163726515, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In163726515} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:02:09,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_159 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} 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-27 03:02:09,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:02:09,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1642434580 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1642434580 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite47_Out1642434580| |ULTIMATE.start_main_#t~ite48_Out1642434580|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1642434580| ~z$w_buff1~0_In1642434580) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out1642434580| ~z~0_In1642434580) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1642434580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1642434580, ~z$w_buff1~0=~z$w_buff1~0_In1642434580, ~z~0=~z~0_In1642434580} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1642434580, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1642434580|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1642434580, ~z$w_buff1~0=~z$w_buff1~0_In1642434580, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1642434580|, ~z~0=~z~0_In1642434580} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:02:09,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In697168682 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In697168682 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out697168682| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out697168682| ~z$w_buff0_used~0_In697168682) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In697168682, ~z$w_buff0_used~0=~z$w_buff0_used~0_In697168682} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In697168682, ~z$w_buff0_used~0=~z$w_buff0_used~0_In697168682, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out697168682|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 03:02:09,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-66441638 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-66441638 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-66441638 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-66441638 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-66441638 |ULTIMATE.start_main_#t~ite50_Out-66441638|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-66441638|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-66441638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-66441638, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-66441638, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-66441638} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-66441638|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-66441638, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-66441638, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-66441638, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-66441638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 03:02:09,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2121631340 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2121631340 256)))) (or (and (= ~z$r_buff0_thd0~0_In2121631340 |ULTIMATE.start_main_#t~ite51_Out2121631340|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out2121631340|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2121631340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2121631340} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2121631340, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2121631340|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2121631340} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 03:02:09,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1002204110 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1002204110 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1002204110 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1002204110 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out1002204110| ~z$r_buff1_thd0~0_In1002204110) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out1002204110| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1002204110, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1002204110, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1002204110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1002204110} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1002204110|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1002204110, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1002204110, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1002204110, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1002204110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 03:02:09,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 2 v_~x~0_130) (= 0 v_~__unbuffered_p2_EAX~0_21) (= v_~z$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite52_35|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_23 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:02:09,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:02:09 BasicIcfg [2019-12-27 03:02:09,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:02:09,666 INFO L168 Benchmark]: Toolchain (without parser) took 138001.01 ms. Allocated memory was 137.4 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 100.7 MB in the beginning and 970.9 MB in the end (delta: -870.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 03:02:09,667 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 03:02:09,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.13 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 154.9 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:09,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.93 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:09,668 INFO L168 Benchmark]: Boogie Preprocessor took 40.38 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:09,668 INFO L168 Benchmark]: RCFGBuilder took 941.85 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 100.1 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:02:09,668 INFO L168 Benchmark]: TraceAbstraction took 136188.94 ms. Allocated memory was 201.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.1 MB in the beginning and 970.9 MB in the end (delta: -870.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 03:02:09,670 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.83 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.13 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.3 MB in the beginning and 154.9 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.93 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.38 ms. Allocated memory is still 201.3 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 941.85 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 100.1 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 136188.94 ms. Allocated memory was 201.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.1 MB in the beginning and 970.9 MB in the end (delta: -870.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 174 ProgramPointsBefore, 92 ProgramPointsAfterwards, 211 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 6843 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 91 SemBasedMoverChecksPositive, 240 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 77200 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L822] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 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, 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] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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] [L783] 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=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=2, 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] [L783] 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) [L784] 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)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, 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] 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)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, 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] [L786] 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)) [L762] 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, 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=2, 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] [L742] 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) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 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 [L762] 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) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 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 [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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)) [L789] 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)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 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=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=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 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) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 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 [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] 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=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=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 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) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 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 [L831] 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, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 135.8s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 68.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11854 SDtfs, 16981 SDslu, 44816 SDs, 0 SdLazy, 39802 SolverSat, 789 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 848 GetRequests, 161 SyntacticMatches, 39 SemanticMatches, 648 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6768 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138429occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.8s AutomataMinimizationTime, 43 MinimizatonAttempts, 503021 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2208 NumberOfCodeBlocks, 2208 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2098 ConstructedInterpolants, 0 QuantifiedInterpolants, 505338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...