/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:24:38,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:24:38,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:24:38,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:24:38,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:24:38,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:24:38,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:24:38,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:24:38,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:24:38,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:24:38,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:24:38,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:24:38,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:24:38,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:24:38,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:24:38,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:24:38,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:24:38,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:24:38,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:24:38,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:24:38,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:24:38,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:24:38,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:24:38,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:24:38,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:24:38,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:24:38,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:24:38,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:24:38,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:24:38,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:24:38,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:24:38,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:24:38,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:24:38,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:24:38,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:24:38,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:24:38,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:24:38,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:24:38,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:24:38,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:24:38,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:24:38,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:24:38,540 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:24:38,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:24:38,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:24:38,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:24:38,544 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:24:38,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:24:38,544 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:24:38,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:24:38,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:24:38,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:24:38,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:24:38,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:24:38,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:24:38,547 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:24:38,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:24:38,547 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:24:38,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:24:38,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:24:38,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:24:38,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:24:38,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:24:38,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:24:38,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:24:38,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:24:38,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:24:38,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:24:38,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:24:38,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:24:38,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:24:38,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:24:38,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:24:38,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:24:38,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:24:38,823 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:24:38,824 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:24:38,824 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i [2019-12-18 12:24:38,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fcb25b98/7c3ba8796251454191d46b5eb2d9f767/FLAG83b190697 [2019-12-18 12:24:39,434 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:24:39,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i [2019-12-18 12:24:39,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fcb25b98/7c3ba8796251454191d46b5eb2d9f767/FLAG83b190697 [2019-12-18 12:24:39,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fcb25b98/7c3ba8796251454191d46b5eb2d9f767 [2019-12-18 12:24:39,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:24:39,718 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:24:39,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:24:39,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:24:39,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:24:39,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:24:39" (1/1) ... [2019-12-18 12:24:39,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:39, skipping insertion in model container [2019-12-18 12:24:39,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:24:39" (1/1) ... [2019-12-18 12:24:39,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:24:39,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:24:40,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:24:40,398 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:24:40,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:24:40,539 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:24:40,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40 WrapperNode [2019-12-18 12:24:40,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:24:40,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:24:40,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:24:40,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:24:40,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... [2019-12-18 12:24:40,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... [2019-12-18 12:24:40,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:24:40,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:24:40,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:24:40,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:24:40,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... [2019-12-18 12:24:40,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... [2019-12-18 12:24:40,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... [2019-12-18 12:24:40,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... [2019-12-18 12:24:40,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... [2019-12-18 12:24:40,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... [2019-12-18 12:24:40,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... [2019-12-18 12:24:40,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:24:40,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:24:40,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:24:40,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:24:40,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:24:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:24:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:24:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:24:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:24:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:24:40,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:24:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:24:40,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:24:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:24:40,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:24:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:24:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:24:40,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:24:40,711 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:24:41,492 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:24:41,493 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:24:41,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:24:41 BoogieIcfgContainer [2019-12-18 12:24:41,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:24:41,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:24:41,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:24:41,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:24:41,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:24:39" (1/3) ... [2019-12-18 12:24:41,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cfda0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:24:41, skipping insertion in model container [2019-12-18 12:24:41,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:24:40" (2/3) ... [2019-12-18 12:24:41,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cfda0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:24:41, skipping insertion in model container [2019-12-18 12:24:41,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:24:41" (3/3) ... [2019-12-18 12:24:41,503 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_tso.oepc.i [2019-12-18 12:24:41,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:24:41,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:24:41,525 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:24:41,526 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:24:41,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,577 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,577 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,624 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,624 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,660 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,662 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:24:41,691 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:24:41,711 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:24:41,711 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:24:41,711 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:24:41,711 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:24:41,711 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:24:41,711 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:24:41,712 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:24:41,712 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:24:41,727 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 12:24:41,729 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:24:41,821 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:24:41,822 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:24:41,844 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:24:41,872 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:24:41,920 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:24:41,920 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:24:41,928 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:24:41,950 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:24:41,952 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:24:46,837 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 12:24:47,236 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:24:47,361 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:24:47,391 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-18 12:24:47,391 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 12:24:47,395 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-18 12:25:08,506 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 12:25:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 12:25:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:25:08,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:08,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:25:08,514 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:08,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:08,519 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-18 12:25:08,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:08,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349870279] [2019-12-18 12:25:08,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:08,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349870279] [2019-12-18 12:25:08,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:08,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:25:08,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014610634] [2019-12-18 12:25:08,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:08,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:08,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:08,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:08,757 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 12:25:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:10,155 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-18 12:25:10,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:10,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:25:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:10,850 INFO L225 Difference]: With dead ends: 125226 [2019-12-18 12:25:10,851 INFO L226 Difference]: Without dead ends: 117946 [2019-12-18 12:25:10,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-18 12:25:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-18 12:25:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-18 12:25:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-18 12:25:23,136 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-18 12:25:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:23,136 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-18 12:25:23,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-18 12:25:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:25:23,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:23,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:23,141 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:23,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:23,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-18 12:25:23,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:23,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647939274] [2019-12-18 12:25:23,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:23,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647939274] [2019-12-18 12:25:23,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:23,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:25:23,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078902214] [2019-12-18 12:25:23,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:25:23,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:23,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:25:23,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:23,306 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-18 12:25:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:28,627 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-18 12:25:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:25:28,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:25:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:29,259 INFO L225 Difference]: With dead ends: 183040 [2019-12-18 12:25:29,259 INFO L226 Difference]: Without dead ends: 182991 [2019-12-18 12:25:29,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-18 12:25:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-18 12:25:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-18 12:25:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-18 12:25:45,354 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-18 12:25:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:45,355 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-18 12:25:45,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:25:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-18 12:25:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:25:45,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:45,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:45,361 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-18 12:25:45,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:45,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062777758] [2019-12-18 12:25:45,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:45,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062777758] [2019-12-18 12:25:45,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:45,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:25:45,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490944311] [2019-12-18 12:25:45,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:25:45,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:45,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:25:45,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:45,424 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-18 12:25:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:45,555 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-18 12:25:45,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:25:45,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:25:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:45,612 INFO L225 Difference]: With dead ends: 35531 [2019-12-18 12:25:45,613 INFO L226 Difference]: Without dead ends: 35531 [2019-12-18 12:25:45,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:25:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-18 12:25:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-18 12:25:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-18 12:25:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-18 12:25:51,918 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-18 12:25:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:51,918 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-18 12:25:51,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:25:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-18 12:25:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:25:51,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:51,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:51,923 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-18 12:25:51,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:51,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710952442] [2019-12-18 12:25:51,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:52,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710952442] [2019-12-18 12:25:52,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:52,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:52,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372744828] [2019-12-18 12:25:52,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:25:52,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:25:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:52,011 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-18 12:25:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:52,615 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-18 12:25:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:25:52,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:25:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:52,694 INFO L225 Difference]: With dead ends: 49606 [2019-12-18 12:25:52,694 INFO L226 Difference]: Without dead ends: 49606 [2019-12-18 12:25:52,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-18 12:25:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-18 12:25:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-18 12:25:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-18 12:25:53,518 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-18 12:25:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:53,519 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-18 12:25:53,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:25:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-18 12:25:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:25:53,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:53,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:53,531 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:53,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:53,531 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-18 12:25:53,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:53,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775422409] [2019-12-18 12:25:53,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:53,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775422409] [2019-12-18 12:25:53,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:53,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:25:53,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992792656] [2019-12-18 12:25:53,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:25:53,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:53,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:25:53,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:25:53,638 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 7 states. [2019-12-18 12:25:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:54,590 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-18 12:25:54,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:25:54,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 12:25:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:54,701 INFO L225 Difference]: With dead ends: 68217 [2019-12-18 12:25:54,701 INFO L226 Difference]: Without dead ends: 68203 [2019-12-18 12:25:54,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:25:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-18 12:25:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-18 12:25:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-18 12:25:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-18 12:25:55,974 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-18 12:25:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:55,974 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-18 12:25:55,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:25:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-18 12:25:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:25:55,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:55,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:55,991 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-18 12:25:55,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:55,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029326210] [2019-12-18 12:25:55,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:56,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029326210] [2019-12-18 12:25:56,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:56,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:56,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109843086] [2019-12-18 12:25:56,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:25:56,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:56,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:25:56,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:56,075 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 4 states. [2019-12-18 12:25:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:56,147 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-18 12:25:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:25:56,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:25:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:56,169 INFO L225 Difference]: With dead ends: 16636 [2019-12-18 12:25:56,170 INFO L226 Difference]: Without dead ends: 16636 [2019-12-18 12:25:56,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:25:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-18 12:25:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-18 12:25:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-18 12:25:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-18 12:25:56,420 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-18 12:25:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:56,420 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-18 12:25:56,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:25:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-18 12:25:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:25:56,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:56,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] [2019-12-18 12:25:56,432 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:56,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-18 12:25:56,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:56,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819768310] [2019-12-18 12:25:56,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:56,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819768310] [2019-12-18 12:25:56,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:56,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:25:56,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557385802] [2019-12-18 12:25:56,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:25:56,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:56,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:25:56,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:25:56,507 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-18 12:25:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:57,010 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-18 12:25:57,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:25:57,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:25:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:57,042 INFO L225 Difference]: With dead ends: 23754 [2019-12-18 12:25:57,043 INFO L226 Difference]: Without dead ends: 23754 [2019-12-18 12:25:57,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:25:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-18 12:25:57,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-18 12:25:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-18 12:25:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-18 12:25:57,359 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-18 12:25:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:57,359 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-18 12:25:57,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:25:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-18 12:25:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:25:57,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:57,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:57,382 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-18 12:25:57,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:57,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296234115] [2019-12-18 12:25:57,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:57,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296234115] [2019-12-18 12:25:57,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:57,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:25:57,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982302033] [2019-12-18 12:25:57,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:25:57,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:57,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:25:57,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:25:57,459 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 5 states. [2019-12-18 12:25:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:57,933 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-18 12:25:57,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:25:57,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 12:25:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:57,966 INFO L225 Difference]: With dead ends: 23902 [2019-12-18 12:25:57,966 INFO L226 Difference]: Without dead ends: 23902 [2019-12-18 12:25:57,967 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-18 12:25:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-18 12:25:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-18 12:25:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-18 12:25:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-18 12:25:58,292 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-18 12:25:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:25:58,292 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-18 12:25:58,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:25:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-18 12:25:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:25:58,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:25:58,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:25:58,317 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:25:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:25:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-18 12:25:58,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:25:58,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143542709] [2019-12-18 12:25:58,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:25:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:25:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:25:58,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143542709] [2019-12-18 12:25:58,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:25:58,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:25:58,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660071743] [2019-12-18 12:25:58,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:25:58,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:25:58,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:25:58,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:25:58,422 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 8 states. [2019-12-18 12:25:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:25:59,736 INFO L93 Difference]: Finished difference Result 27626 states and 80996 transitions. [2019-12-18 12:25:59,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:25:59,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:25:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:25:59,774 INFO L225 Difference]: With dead ends: 27626 [2019-12-18 12:25:59,775 INFO L226 Difference]: Without dead ends: 27626 [2019-12-18 12:25:59,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:25:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27626 states. [2019-12-18 12:26:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27626 to 17400. [2019-12-18 12:26:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17400 states. [2019-12-18 12:26:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 52480 transitions. [2019-12-18 12:26:00,105 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 52480 transitions. Word has length 33 [2019-12-18 12:26:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:00,105 INFO L462 AbstractCegarLoop]: Abstraction has 17400 states and 52480 transitions. [2019-12-18 12:26:00,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:26:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 52480 transitions. [2019-12-18 12:26:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:26:00,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:00,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:00,128 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-18 12:26:00,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:00,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471997921] [2019-12-18 12:26:00,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:00,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471997921] [2019-12-18 12:26:00,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:00,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:26:00,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828616468] [2019-12-18 12:26:00,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:00,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:00,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:00,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:00,189 INFO L87 Difference]: Start difference. First operand 17400 states and 52480 transitions. Second operand 3 states. [2019-12-18 12:26:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:00,263 INFO L93 Difference]: Finished difference Result 17399 states and 52478 transitions. [2019-12-18 12:26:00,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:00,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:26:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:00,300 INFO L225 Difference]: With dead ends: 17399 [2019-12-18 12:26:00,300 INFO L226 Difference]: Without dead ends: 17399 [2019-12-18 12:26:00,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2019-12-18 12:26:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 17399. [2019-12-18 12:26:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17399 states. [2019-12-18 12:26:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17399 states to 17399 states and 52478 transitions. [2019-12-18 12:26:00,719 INFO L78 Accepts]: Start accepts. Automaton has 17399 states and 52478 transitions. Word has length 39 [2019-12-18 12:26:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:00,719 INFO L462 AbstractCegarLoop]: Abstraction has 17399 states and 52478 transitions. [2019-12-18 12:26:00,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 17399 states and 52478 transitions. [2019-12-18 12:26:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:26:00,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:00,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:00,745 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-18 12:26:00,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:00,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325388732] [2019-12-18 12:26:00,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:00,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325388732] [2019-12-18 12:26:00,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:00,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:26:00,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140516762] [2019-12-18 12:26:00,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:26:00,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:26:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:26:00,837 INFO L87 Difference]: Start difference. First operand 17399 states and 52478 transitions. Second operand 6 states. [2019-12-18 12:26:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:01,782 INFO L93 Difference]: Finished difference Result 34243 states and 103303 transitions. [2019-12-18 12:26:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:26:01,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 12:26:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:01,833 INFO L225 Difference]: With dead ends: 34243 [2019-12-18 12:26:01,833 INFO L226 Difference]: Without dead ends: 34243 [2019-12-18 12:26:01,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34243 states. [2019-12-18 12:26:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34243 to 22015. [2019-12-18 12:26:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22015 states. [2019-12-18 12:26:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 66470 transitions. [2019-12-18 12:26:02,435 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 66470 transitions. Word has length 40 [2019-12-18 12:26:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:02,435 INFO L462 AbstractCegarLoop]: Abstraction has 22015 states and 66470 transitions. [2019-12-18 12:26:02,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:26:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 66470 transitions. [2019-12-18 12:26:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:26:02,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:02,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:02,461 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:02,461 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-18 12:26:02,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:02,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910596285] [2019-12-18 12:26:02,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:02,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910596285] [2019-12-18 12:26:02,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:02,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:26:02,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528189533] [2019-12-18 12:26:02,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:26:02,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:26:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:26:02,551 INFO L87 Difference]: Start difference. First operand 22015 states and 66470 transitions. Second operand 5 states. [2019-12-18 12:26:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:03,254 INFO L93 Difference]: Finished difference Result 30046 states and 90242 transitions. [2019-12-18 12:26:03,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:26:03,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:26:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:03,312 INFO L225 Difference]: With dead ends: 30046 [2019-12-18 12:26:03,313 INFO L226 Difference]: Without dead ends: 30046 [2019-12-18 12:26:03,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:26:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30046 states. [2019-12-18 12:26:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30046 to 26807. [2019-12-18 12:26:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-18 12:26:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81221 transitions. [2019-12-18 12:26:03,743 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81221 transitions. Word has length 40 [2019-12-18 12:26:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:03,743 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81221 transitions. [2019-12-18 12:26:03,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:26:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81221 transitions. [2019-12-18 12:26:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:26:03,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:03,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:03,777 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-18 12:26:03,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:03,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727347330] [2019-12-18 12:26:03,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:03,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727347330] [2019-12-18 12:26:03,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:03,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:26:03,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650514900] [2019-12-18 12:26:03,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:26:03,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:03,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:26:03,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:26:03,835 INFO L87 Difference]: Start difference. First operand 26807 states and 81221 transitions. Second operand 5 states. [2019-12-18 12:26:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:03,958 INFO L93 Difference]: Finished difference Result 25470 states and 78136 transitions. [2019-12-18 12:26:03,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:26:03,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:26:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:03,996 INFO L225 Difference]: With dead ends: 25470 [2019-12-18 12:26:03,997 INFO L226 Difference]: Without dead ends: 25470 [2019-12-18 12:26:03,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:26:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25470 states. [2019-12-18 12:26:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25470 to 24504. [2019-12-18 12:26:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-18 12:26:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 75530 transitions. [2019-12-18 12:26:04,376 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 75530 transitions. Word has length 40 [2019-12-18 12:26:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:04,377 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 75530 transitions. [2019-12-18 12:26:04,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:26:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 75530 transitions. [2019-12-18 12:26:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:04,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:04,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:04,403 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash 974609302, now seen corresponding path program 1 times [2019-12-18 12:26:04,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:04,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363683285] [2019-12-18 12:26:04,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:04,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363683285] [2019-12-18 12:26:04,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:04,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:26:04,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246230933] [2019-12-18 12:26:04,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:04,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:04,453 INFO L87 Difference]: Start difference. First operand 24504 states and 75530 transitions. Second operand 3 states. [2019-12-18 12:26:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:04,590 INFO L93 Difference]: Finished difference Result 34625 states and 106821 transitions. [2019-12-18 12:26:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:04,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:26:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:04,639 INFO L225 Difference]: With dead ends: 34625 [2019-12-18 12:26:04,640 INFO L226 Difference]: Without dead ends: 34625 [2019-12-18 12:26:04,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34625 states. [2019-12-18 12:26:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34625 to 27128. [2019-12-18 12:26:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27128 states. [2019-12-18 12:26:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27128 states to 27128 states and 84304 transitions. [2019-12-18 12:26:05,284 INFO L78 Accepts]: Start accepts. Automaton has 27128 states and 84304 transitions. Word has length 64 [2019-12-18 12:26:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:05,284 INFO L462 AbstractCegarLoop]: Abstraction has 27128 states and 84304 transitions. [2019-12-18 12:26:05,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 27128 states and 84304 transitions. [2019-12-18 12:26:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:05,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:05,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:05,315 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:05,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-18 12:26:05,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:05,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791790986] [2019-12-18 12:26:05,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:05,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791790986] [2019-12-18 12:26:05,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:05,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:26:05,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802904048] [2019-12-18 12:26:05,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:26:05,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:05,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:26:05,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:26:05,403 INFO L87 Difference]: Start difference. First operand 27128 states and 84304 transitions. Second operand 7 states. [2019-12-18 12:26:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:06,010 INFO L93 Difference]: Finished difference Result 73273 states and 226524 transitions. [2019-12-18 12:26:06,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:26:06,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:26:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:06,102 INFO L225 Difference]: With dead ends: 73273 [2019-12-18 12:26:06,102 INFO L226 Difference]: Without dead ends: 55201 [2019-12-18 12:26:06,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:26:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55201 states. [2019-12-18 12:26:06,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55201 to 31445. [2019-12-18 12:26:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31445 states. [2019-12-18 12:26:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31445 states to 31445 states and 97708 transitions. [2019-12-18 12:26:06,801 INFO L78 Accepts]: Start accepts. Automaton has 31445 states and 97708 transitions. Word has length 64 [2019-12-18 12:26:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:06,801 INFO L462 AbstractCegarLoop]: Abstraction has 31445 states and 97708 transitions. [2019-12-18 12:26:06,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:26:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 31445 states and 97708 transitions. [2019-12-18 12:26:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:06,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:06,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:06,841 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-18 12:26:06,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:06,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356409017] [2019-12-18 12:26:06,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:06,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-18 12:26:06,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356409017] [2019-12-18 12:26:06,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:06,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:26:06,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803615796] [2019-12-18 12:26:06,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:26:06,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:06,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:26:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:26:06,946 INFO L87 Difference]: Start difference. First operand 31445 states and 97708 transitions. Second operand 7 states. [2019-12-18 12:26:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:07,488 INFO L93 Difference]: Finished difference Result 81140 states and 248111 transitions. [2019-12-18 12:26:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:26:07,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:26:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:07,574 INFO L225 Difference]: With dead ends: 81140 [2019-12-18 12:26:07,575 INFO L226 Difference]: Without dead ends: 57495 [2019-12-18 12:26:07,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:26:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57495 states. [2019-12-18 12:26:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57495 to 35246. [2019-12-18 12:26:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35246 states. [2019-12-18 12:26:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35246 states to 35246 states and 109148 transitions. [2019-12-18 12:26:08,557 INFO L78 Accepts]: Start accepts. Automaton has 35246 states and 109148 transitions. Word has length 64 [2019-12-18 12:26:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:08,557 INFO L462 AbstractCegarLoop]: Abstraction has 35246 states and 109148 transitions. [2019-12-18 12:26:08,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:26:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 35246 states and 109148 transitions. [2019-12-18 12:26:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:08,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:08,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:08,597 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-18 12:26:08,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:08,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156065616] [2019-12-18 12:26:08,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:08,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156065616] [2019-12-18 12:26:08,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:08,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:26:08,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208092482] [2019-12-18 12:26:08,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:26:08,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:26:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:26:08,704 INFO L87 Difference]: Start difference. First operand 35246 states and 109148 transitions. Second operand 8 states. [2019-12-18 12:26:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:09,855 INFO L93 Difference]: Finished difference Result 98595 states and 302496 transitions. [2019-12-18 12:26:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:26:09,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 12:26:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:09,991 INFO L225 Difference]: With dead ends: 98595 [2019-12-18 12:26:09,991 INFO L226 Difference]: Without dead ends: 87943 [2019-12-18 12:26:09,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:26:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87943 states. [2019-12-18 12:26:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87943 to 35744. [2019-12-18 12:26:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35744 states. [2019-12-18 12:26:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35744 states to 35744 states and 111048 transitions. [2019-12-18 12:26:11,332 INFO L78 Accepts]: Start accepts. Automaton has 35744 states and 111048 transitions. Word has length 64 [2019-12-18 12:26:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:11,333 INFO L462 AbstractCegarLoop]: Abstraction has 35744 states and 111048 transitions. [2019-12-18 12:26:11,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:26:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 35744 states and 111048 transitions. [2019-12-18 12:26:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:11,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:11,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:11,373 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-18 12:26:11,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:11,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486298152] [2019-12-18 12:26:11,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:11,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486298152] [2019-12-18 12:26:11,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:11,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:11,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785893651] [2019-12-18 12:26:11,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:11,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:11,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:11,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:11,488 INFO L87 Difference]: Start difference. First operand 35744 states and 111048 transitions. Second operand 9 states. [2019-12-18 12:26:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:13,145 INFO L93 Difference]: Finished difference Result 119468 states and 363005 transitions. [2019-12-18 12:26:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:26:13,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:26:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:13,316 INFO L225 Difference]: With dead ends: 119468 [2019-12-18 12:26:13,316 INFO L226 Difference]: Without dead ends: 105156 [2019-12-18 12:26:13,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:26:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105156 states. [2019-12-18 12:26:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105156 to 35780. [2019-12-18 12:26:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35780 states. [2019-12-18 12:26:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35780 states to 35780 states and 111205 transitions. [2019-12-18 12:26:14,496 INFO L78 Accepts]: Start accepts. Automaton has 35780 states and 111205 transitions. Word has length 64 [2019-12-18 12:26:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:14,496 INFO L462 AbstractCegarLoop]: Abstraction has 35780 states and 111205 transitions. [2019-12-18 12:26:14,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35780 states and 111205 transitions. [2019-12-18 12:26:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:14,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:14,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:14,537 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash 836129701, now seen corresponding path program 5 times [2019-12-18 12:26:14,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:14,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331970452] [2019-12-18 12:26:14,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:14,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331970452] [2019-12-18 12:26:14,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:14,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:14,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005037598] [2019-12-18 12:26:14,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:14,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:14,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:14,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:14,656 INFO L87 Difference]: Start difference. First operand 35780 states and 111205 transitions. Second operand 9 states. [2019-12-18 12:26:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:16,584 INFO L93 Difference]: Finished difference Result 131669 states and 399951 transitions. [2019-12-18 12:26:16,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:26:16,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:26:16,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:16,776 INFO L225 Difference]: With dead ends: 131669 [2019-12-18 12:26:16,777 INFO L226 Difference]: Without dead ends: 121803 [2019-12-18 12:26:16,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:26:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121803 states. [2019-12-18 12:26:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121803 to 35817. [2019-12-18 12:26:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35817 states. [2019-12-18 12:26:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35817 states to 35817 states and 111367 transitions. [2019-12-18 12:26:18,056 INFO L78 Accepts]: Start accepts. Automaton has 35817 states and 111367 transitions. Word has length 64 [2019-12-18 12:26:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:18,057 INFO L462 AbstractCegarLoop]: Abstraction has 35817 states and 111367 transitions. [2019-12-18 12:26:18,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 35817 states and 111367 transitions. [2019-12-18 12:26:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:26:18,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:18,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:18,097 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:18,097 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 6 times [2019-12-18 12:26:18,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:18,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589477368] [2019-12-18 12:26:18,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:18,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589477368] [2019-12-18 12:26:18,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:18,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:18,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284372157] [2019-12-18 12:26:18,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:18,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:18,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:18,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:18,166 INFO L87 Difference]: Start difference. First operand 35817 states and 111367 transitions. Second operand 3 states. [2019-12-18 12:26:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:18,359 INFO L93 Difference]: Finished difference Result 42547 states and 131537 transitions. [2019-12-18 12:26:18,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:18,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:26:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:18,421 INFO L225 Difference]: With dead ends: 42547 [2019-12-18 12:26:18,421 INFO L226 Difference]: Without dead ends: 42547 [2019-12-18 12:26:18,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42547 states. [2019-12-18 12:26:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42547 to 37071. [2019-12-18 12:26:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37071 states. [2019-12-18 12:26:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37071 states to 37071 states and 115326 transitions. [2019-12-18 12:26:19,290 INFO L78 Accepts]: Start accepts. Automaton has 37071 states and 115326 transitions. Word has length 64 [2019-12-18 12:26:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:19,291 INFO L462 AbstractCegarLoop]: Abstraction has 37071 states and 115326 transitions. [2019-12-18 12:26:19,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 37071 states and 115326 transitions. [2019-12-18 12:26:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:19,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:19,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:19,332 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:19,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:19,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-18 12:26:19,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:19,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665507837] [2019-12-18 12:26:19,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:19,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665507837] [2019-12-18 12:26:19,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:19,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:26:19,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424406512] [2019-12-18 12:26:19,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:26:19,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:26:19,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:26:19,421 INFO L87 Difference]: Start difference. First operand 37071 states and 115326 transitions. Second operand 8 states. [2019-12-18 12:26:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:20,708 INFO L93 Difference]: Finished difference Result 111740 states and 339408 transitions. [2019-12-18 12:26:20,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:26:20,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:26:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:20,861 INFO L225 Difference]: With dead ends: 111740 [2019-12-18 12:26:20,861 INFO L226 Difference]: Without dead ends: 99733 [2019-12-18 12:26:20,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:26:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99733 states. [2019-12-18 12:26:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99733 to 37073. [2019-12-18 12:26:21,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37073 states. [2019-12-18 12:26:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37073 states to 37073 states and 115341 transitions. [2019-12-18 12:26:21,950 INFO L78 Accepts]: Start accepts. Automaton has 37073 states and 115341 transitions. Word has length 65 [2019-12-18 12:26:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:21,950 INFO L462 AbstractCegarLoop]: Abstraction has 37073 states and 115341 transitions. [2019-12-18 12:26:21,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:26:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 37073 states and 115341 transitions. [2019-12-18 12:26:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:21,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:21,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:21,992 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:21,992 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-18 12:26:21,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:21,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985256380] [2019-12-18 12:26:21,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:22,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985256380] [2019-12-18 12:26:22,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:22,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:22,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703040039] [2019-12-18 12:26:22,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:22,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:22,103 INFO L87 Difference]: Start difference. First operand 37073 states and 115341 transitions. Second operand 9 states. [2019-12-18 12:26:22,532 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-18 12:26:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:23,891 INFO L93 Difference]: Finished difference Result 134194 states and 407074 transitions. [2019-12-18 12:26:23,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:26:23,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:26:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:24,084 INFO L225 Difference]: With dead ends: 134194 [2019-12-18 12:26:24,084 INFO L226 Difference]: Without dead ends: 122325 [2019-12-18 12:26:24,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:26:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122325 states. [2019-12-18 12:26:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122325 to 37029. [2019-12-18 12:26:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37029 states. [2019-12-18 12:26:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37029 states to 37029 states and 115116 transitions. [2019-12-18 12:26:25,360 INFO L78 Accepts]: Start accepts. Automaton has 37029 states and 115116 transitions. Word has length 65 [2019-12-18 12:26:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:25,360 INFO L462 AbstractCegarLoop]: Abstraction has 37029 states and 115116 transitions. [2019-12-18 12:26:25,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 37029 states and 115116 transitions. [2019-12-18 12:26:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:25,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:25,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:25,399 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:25,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:25,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1293437306, now seen corresponding path program 3 times [2019-12-18 12:26:25,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:25,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050770226] [2019-12-18 12:26:25,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:25,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050770226] [2019-12-18 12:26:25,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:25,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:25,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251942980] [2019-12-18 12:26:25,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:25,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:25,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:25,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:25,514 INFO L87 Difference]: Start difference. First operand 37029 states and 115116 transitions. Second operand 9 states. [2019-12-18 12:26:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:27,647 INFO L93 Difference]: Finished difference Result 153077 states and 465403 transitions. [2019-12-18 12:26:27,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:26:27,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:26:27,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:27,840 INFO L225 Difference]: With dead ends: 153077 [2019-12-18 12:26:27,840 INFO L226 Difference]: Without dead ends: 125434 [2019-12-18 12:26:27,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:26:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125434 states. [2019-12-18 12:26:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125434 to 40153. [2019-12-18 12:26:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40153 states. [2019-12-18 12:26:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40153 states to 40153 states and 125039 transitions. [2019-12-18 12:26:29,139 INFO L78 Accepts]: Start accepts. Automaton has 40153 states and 125039 transitions. Word has length 65 [2019-12-18 12:26:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:29,140 INFO L462 AbstractCegarLoop]: Abstraction has 40153 states and 125039 transitions. [2019-12-18 12:26:29,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40153 states and 125039 transitions. [2019-12-18 12:26:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:29,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:29,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:29,188 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-18 12:26:29,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:29,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037849842] [2019-12-18 12:26:29,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:29,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037849842] [2019-12-18 12:26:29,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:29,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:26:29,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609104707] [2019-12-18 12:26:29,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:26:29,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:29,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:26:29,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:26:29,299 INFO L87 Difference]: Start difference. First operand 40153 states and 125039 transitions. Second operand 7 states. [2019-12-18 12:26:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:30,420 INFO L93 Difference]: Finished difference Result 55596 states and 169227 transitions. [2019-12-18 12:26:30,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:26:30,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:26:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:30,510 INFO L225 Difference]: With dead ends: 55596 [2019-12-18 12:26:30,510 INFO L226 Difference]: Without dead ends: 55596 [2019-12-18 12:26:30,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:26:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55596 states. [2019-12-18 12:26:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55596 to 42525. [2019-12-18 12:26:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2019-12-18 12:26:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 131689 transitions. [2019-12-18 12:26:31,555 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 131689 transitions. Word has length 65 [2019-12-18 12:26:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:31,556 INFO L462 AbstractCegarLoop]: Abstraction has 42525 states and 131689 transitions. [2019-12-18 12:26:31,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:26:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 131689 transitions. [2019-12-18 12:26:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:31,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:31,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:31,601 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:31,602 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-18 12:26:31,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:31,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069725238] [2019-12-18 12:26:31,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:31,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069725238] [2019-12-18 12:26:31,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:31,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:26:31,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127047394] [2019-12-18 12:26:31,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:31,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:31,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:31,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:31,738 INFO L87 Difference]: Start difference. First operand 42525 states and 131689 transitions. Second operand 9 states. [2019-12-18 12:26:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:33,788 INFO L93 Difference]: Finished difference Result 66164 states and 202890 transitions. [2019-12-18 12:26:33,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:26:33,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:26:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:33,894 INFO L225 Difference]: With dead ends: 66164 [2019-12-18 12:26:33,894 INFO L226 Difference]: Without dead ends: 66164 [2019-12-18 12:26:33,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:26:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66164 states. [2019-12-18 12:26:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66164 to 41944. [2019-12-18 12:26:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41944 states. [2019-12-18 12:26:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41944 states to 41944 states and 130085 transitions. [2019-12-18 12:26:34,767 INFO L78 Accepts]: Start accepts. Automaton has 41944 states and 130085 transitions. Word has length 65 [2019-12-18 12:26:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:34,767 INFO L462 AbstractCegarLoop]: Abstraction has 41944 states and 130085 transitions. [2019-12-18 12:26:34,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 41944 states and 130085 transitions. [2019-12-18 12:26:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:34,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:34,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:34,819 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-18 12:26:34,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:34,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709586472] [2019-12-18 12:26:34,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:34,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709586472] [2019-12-18 12:26:34,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:34,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:34,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485275994] [2019-12-18 12:26:34,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:26:34,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:26:34,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:26:34,938 INFO L87 Difference]: Start difference. First operand 41944 states and 130085 transitions. Second operand 8 states. [2019-12-18 12:26:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:36,635 INFO L93 Difference]: Finished difference Result 55795 states and 168786 transitions. [2019-12-18 12:26:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:26:36,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:26:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:36,715 INFO L225 Difference]: With dead ends: 55795 [2019-12-18 12:26:36,715 INFO L226 Difference]: Without dead ends: 55795 [2019-12-18 12:26:36,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:26:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55795 states. [2019-12-18 12:26:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55795 to 43437. [2019-12-18 12:26:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43437 states. [2019-12-18 12:26:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43437 states to 43437 states and 134338 transitions. [2019-12-18 12:26:37,713 INFO L78 Accepts]: Start accepts. Automaton has 43437 states and 134338 transitions. Word has length 65 [2019-12-18 12:26:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:37,714 INFO L462 AbstractCegarLoop]: Abstraction has 43437 states and 134338 transitions. [2019-12-18 12:26:37,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:26:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 43437 states and 134338 transitions. [2019-12-18 12:26:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:37,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:37,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:37,761 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:37,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1193547640, now seen corresponding path program 2 times [2019-12-18 12:26:37,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:37,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488292268] [2019-12-18 12:26:37,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:37,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-18 12:26:37,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488292268] [2019-12-18 12:26:37,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:37,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:37,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093356800] [2019-12-18 12:26:37,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:37,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:37,949 INFO L87 Difference]: Start difference. First operand 43437 states and 134338 transitions. Second operand 9 states. [2019-12-18 12:26:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:39,465 INFO L93 Difference]: Finished difference Result 66620 states and 204092 transitions. [2019-12-18 12:26:39,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:26:39,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:26:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:39,569 INFO L225 Difference]: With dead ends: 66620 [2019-12-18 12:26:39,570 INFO L226 Difference]: Without dead ends: 66620 [2019-12-18 12:26:39,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:26:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66620 states. [2019-12-18 12:26:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66620 to 43912. [2019-12-18 12:26:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43912 states. [2019-12-18 12:26:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43912 states to 43912 states and 136009 transitions. [2019-12-18 12:26:40,477 INFO L78 Accepts]: Start accepts. Automaton has 43912 states and 136009 transitions. Word has length 65 [2019-12-18 12:26:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:40,477 INFO L462 AbstractCegarLoop]: Abstraction has 43912 states and 136009 transitions. [2019-12-18 12:26:40,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 43912 states and 136009 transitions. [2019-12-18 12:26:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:40,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:40,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:40,529 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:40,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1646807062, now seen corresponding path program 3 times [2019-12-18 12:26:40,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:40,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77488236] [2019-12-18 12:26:40,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:40,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77488236] [2019-12-18 12:26:40,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:40,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:26:40,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277487061] [2019-12-18 12:26:40,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:26:40,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:26:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:26:40,657 INFO L87 Difference]: Start difference. First operand 43912 states and 136009 transitions. Second operand 10 states. [2019-12-18 12:26:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:43,384 INFO L93 Difference]: Finished difference Result 68090 states and 207818 transitions. [2019-12-18 12:26:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 12:26:43,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:26:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:43,482 INFO L225 Difference]: With dead ends: 68090 [2019-12-18 12:26:43,483 INFO L226 Difference]: Without dead ends: 68090 [2019-12-18 12:26:43,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 12:26:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68090 states. [2019-12-18 12:26:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68090 to 39586. [2019-12-18 12:26:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-18 12:26:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 123177 transitions. [2019-12-18 12:26:44,304 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 123177 transitions. Word has length 65 [2019-12-18 12:26:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:44,304 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 123177 transitions. [2019-12-18 12:26:44,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:26:44,304 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 123177 transitions. [2019-12-18 12:26:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:44,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:44,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:44,348 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:44,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1534293356, now seen corresponding path program 6 times [2019-12-18 12:26:44,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:44,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196924534] [2019-12-18 12:26:44,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:44,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196924534] [2019-12-18 12:26:44,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:44,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:26:44,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375048001] [2019-12-18 12:26:44,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:26:44,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:44,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:26:44,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:26:44,403 INFO L87 Difference]: Start difference. First operand 39586 states and 123177 transitions. Second operand 4 states. [2019-12-18 12:26:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:44,572 INFO L93 Difference]: Finished difference Result 39586 states and 122905 transitions. [2019-12-18 12:26:44,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:26:44,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 12:26:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:44,625 INFO L225 Difference]: With dead ends: 39586 [2019-12-18 12:26:44,626 INFO L226 Difference]: Without dead ends: 39586 [2019-12-18 12:26:44,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:26:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39586 states. [2019-12-18 12:26:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39586 to 37695. [2019-12-18 12:26:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2019-12-18 12:26:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 117130 transitions. [2019-12-18 12:26:45,210 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 117130 transitions. Word has length 65 [2019-12-18 12:26:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:45,211 INFO L462 AbstractCegarLoop]: Abstraction has 37695 states and 117130 transitions. [2019-12-18 12:26:45,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:26:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 117130 transitions. [2019-12-18 12:26:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:26:45,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:45,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:45,257 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1521961444, now seen corresponding path program 4 times [2019-12-18 12:26:45,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:45,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878336870] [2019-12-18 12:26:45,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:45,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878336870] [2019-12-18 12:26:45,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:45,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:45,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227436421] [2019-12-18 12:26:45,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:45,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:45,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:45,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:45,312 INFO L87 Difference]: Start difference. First operand 37695 states and 117130 transitions. Second operand 3 states. [2019-12-18 12:26:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:45,472 INFO L93 Difference]: Finished difference Result 37694 states and 117128 transitions. [2019-12-18 12:26:45,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:45,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:26:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:45,529 INFO L225 Difference]: With dead ends: 37694 [2019-12-18 12:26:45,530 INFO L226 Difference]: Without dead ends: 37694 [2019-12-18 12:26:45,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37694 states. [2019-12-18 12:26:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37694 to 29303. [2019-12-18 12:26:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29303 states. [2019-12-18 12:26:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29303 states to 29303 states and 93686 transitions. [2019-12-18 12:26:46,373 INFO L78 Accepts]: Start accepts. Automaton has 29303 states and 93686 transitions. Word has length 65 [2019-12-18 12:26:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:46,373 INFO L462 AbstractCegarLoop]: Abstraction has 29303 states and 93686 transitions. [2019-12-18 12:26:46,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 29303 states and 93686 transitions. [2019-12-18 12:26:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:26:46,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:46,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:46,408 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:26:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 392067852, now seen corresponding path program 1 times [2019-12-18 12:26:46,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:46,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265171767] [2019-12-18 12:26:46,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:46,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265171767] [2019-12-18 12:26:46,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:46,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:46,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106785884] [2019-12-18 12:26:46,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:46,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:46,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:46,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:46,470 INFO L87 Difference]: Start difference. First operand 29303 states and 93686 transitions. Second operand 3 states. [2019-12-18 12:26:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:46,582 INFO L93 Difference]: Finished difference Result 24020 states and 75388 transitions. [2019-12-18 12:26:46,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:46,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:26:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:46,637 INFO L225 Difference]: With dead ends: 24020 [2019-12-18 12:26:46,638 INFO L226 Difference]: Without dead ends: 24020 [2019-12-18 12:26:46,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:46,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24020 states. [2019-12-18 12:26:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24020 to 22094. [2019-12-18 12:26:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22094 states. [2019-12-18 12:26:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22094 states to 22094 states and 69094 transitions. [2019-12-18 12:26:47,318 INFO L78 Accepts]: Start accepts. Automaton has 22094 states and 69094 transitions. Word has length 66 [2019-12-18 12:26:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:47,319 INFO L462 AbstractCegarLoop]: Abstraction has 22094 states and 69094 transitions. [2019-12-18 12:26:47,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 22094 states and 69094 transitions. [2019-12-18 12:26:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:47,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:47,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:47,353 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-18 12:26:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2062742571, now seen corresponding path program 1 times [2019-12-18 12:26:47,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:47,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35990856] [2019-12-18 12:26:47,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:47,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35990856] [2019-12-18 12:26:47,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:47,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:47,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636198211] [2019-12-18 12:26:47,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:26:47,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:47,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:26:47,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:26:47,452 INFO L87 Difference]: Start difference. First operand 22094 states and 69094 transitions. Second operand 9 states. [2019-12-18 12:26:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:49,087 INFO L93 Difference]: Finished difference Result 42939 states and 132861 transitions. [2019-12-18 12:26:49,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:26:49,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:26:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:49,137 INFO L225 Difference]: With dead ends: 42939 [2019-12-18 12:26:49,137 INFO L226 Difference]: Without dead ends: 35065 [2019-12-18 12:26:49,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:26:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35065 states. [2019-12-18 12:26:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35065 to 22778. [2019-12-18 12:26:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22778 states. [2019-12-18 12:26:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22778 states to 22778 states and 70805 transitions. [2019-12-18 12:26:49,569 INFO L78 Accepts]: Start accepts. Automaton has 22778 states and 70805 transitions. Word has length 67 [2019-12-18 12:26:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:49,570 INFO L462 AbstractCegarLoop]: Abstraction has 22778 states and 70805 transitions. [2019-12-18 12:26:49,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:26:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 22778 states and 70805 transitions. [2019-12-18 12:26:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:49,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:49,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:49,596 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-18 12:26:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:49,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1535531457, now seen corresponding path program 2 times [2019-12-18 12:26:49,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:49,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392421479] [2019-12-18 12:26:49,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:49,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392421479] [2019-12-18 12:26:49,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:49,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:49,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236917754] [2019-12-18 12:26:49,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:26:49,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:49,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:26:49,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:26:49,759 INFO L87 Difference]: Start difference. First operand 22778 states and 70805 transitions. Second operand 10 states. [2019-12-18 12:26:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:50,734 INFO L93 Difference]: Finished difference Result 44683 states and 137584 transitions. [2019-12-18 12:26:50,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 12:26:50,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:26:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:50,798 INFO L225 Difference]: With dead ends: 44683 [2019-12-18 12:26:50,798 INFO L226 Difference]: Without dead ends: 42768 [2019-12-18 12:26:50,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:26:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42768 states. [2019-12-18 12:26:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42768 to 26032. [2019-12-18 12:26:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26032 states. [2019-12-18 12:26:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26032 states to 26032 states and 80627 transitions. [2019-12-18 12:26:51,705 INFO L78 Accepts]: Start accepts. Automaton has 26032 states and 80627 transitions. Word has length 67 [2019-12-18 12:26:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:51,705 INFO L462 AbstractCegarLoop]: Abstraction has 26032 states and 80627 transitions. [2019-12-18 12:26:51,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:26:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 26032 states and 80627 transitions. [2019-12-18 12:26:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:51,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:51,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:51,737 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-18 12:26:51,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:51,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171729, now seen corresponding path program 3 times [2019-12-18 12:26:51,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:51,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321517424] [2019-12-18 12:26:51,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:51,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321517424] [2019-12-18 12:26:51,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:51,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:26:51,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816471291] [2019-12-18 12:26:51,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:26:51,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:26:51,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:26:51,895 INFO L87 Difference]: Start difference. First operand 26032 states and 80627 transitions. Second operand 10 states. [2019-12-18 12:26:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:52,783 INFO L93 Difference]: Finished difference Result 43340 states and 133082 transitions. [2019-12-18 12:26:52,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:26:52,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:26:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:52,833 INFO L225 Difference]: With dead ends: 43340 [2019-12-18 12:26:52,834 INFO L226 Difference]: Without dead ends: 36825 [2019-12-18 12:26:52,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:26:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36825 states. [2019-12-18 12:26:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36825 to 22389. [2019-12-18 12:26:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22389 states. [2019-12-18 12:26:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22389 states to 22389 states and 69376 transitions. [2019-12-18 12:26:53,280 INFO L78 Accepts]: Start accepts. Automaton has 22389 states and 69376 transitions. Word has length 67 [2019-12-18 12:26:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:53,280 INFO L462 AbstractCegarLoop]: Abstraction has 22389 states and 69376 transitions. [2019-12-18 12:26:53,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:26:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 22389 states and 69376 transitions. [2019-12-18 12:26:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:53,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:53,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:53,308 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-18 12:26:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:53,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2065446981, now seen corresponding path program 4 times [2019-12-18 12:26:53,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:53,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072342226] [2019-12-18 12:26:53,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:53,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072342226] [2019-12-18 12:26:53,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:53,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:26:53,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797284591] [2019-12-18 12:26:53,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:26:53,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:53,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:26:53,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:26:53,463 INFO L87 Difference]: Start difference. First operand 22389 states and 69376 transitions. Second operand 11 states. [2019-12-18 12:26:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:54,521 INFO L93 Difference]: Finished difference Result 39336 states and 121084 transitions. [2019-12-18 12:26:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:26:54,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:26:54,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:54,577 INFO L225 Difference]: With dead ends: 39336 [2019-12-18 12:26:54,577 INFO L226 Difference]: Without dead ends: 38317 [2019-12-18 12:26:54,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:26:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38317 states. [2019-12-18 12:26:55,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38317 to 24692. [2019-12-18 12:26:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24692 states. [2019-12-18 12:26:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24692 states to 24692 states and 76375 transitions. [2019-12-18 12:26:55,087 INFO L78 Accepts]: Start accepts. Automaton has 24692 states and 76375 transitions. Word has length 67 [2019-12-18 12:26:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:55,088 INFO L462 AbstractCegarLoop]: Abstraction has 24692 states and 76375 transitions. [2019-12-18 12:26:55,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:26:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 24692 states and 76375 transitions. [2019-12-18 12:26:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:55,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:55,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:55,115 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-18 12:26:55,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:55,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2136160587, now seen corresponding path program 5 times [2019-12-18 12:26:55,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:55,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155319673] [2019-12-18 12:26:55,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:55,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155319673] [2019-12-18 12:26:55,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:55,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:26:55,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149566201] [2019-12-18 12:26:55,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:26:55,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:55,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:26:55,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:26:55,254 INFO L87 Difference]: Start difference. First operand 24692 states and 76375 transitions. Second operand 11 states. [2019-12-18 12:26:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:56,201 INFO L93 Difference]: Finished difference Result 38879 states and 119266 transitions. [2019-12-18 12:26:56,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:26:56,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:26:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:56,250 INFO L225 Difference]: With dead ends: 38879 [2019-12-18 12:26:56,250 INFO L226 Difference]: Without dead ends: 35558 [2019-12-18 12:26:56,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:26:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35558 states. [2019-12-18 12:26:56,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35558 to 21700. [2019-12-18 12:26:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21700 states. [2019-12-18 12:26:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21700 states to 21700 states and 67268 transitions. [2019-12-18 12:26:56,672 INFO L78 Accepts]: Start accepts. Automaton has 21700 states and 67268 transitions. Word has length 67 [2019-12-18 12:26:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:56,672 INFO L462 AbstractCegarLoop]: Abstraction has 21700 states and 67268 transitions. [2019-12-18 12:26:56,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:26:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 21700 states and 67268 transitions. [2019-12-18 12:26:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:56,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:56,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:56,694 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-18 12:26:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:56,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 6 times [2019-12-18 12:26:56,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:56,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899318769] [2019-12-18 12:26:56,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:26:56,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899318769] [2019-12-18 12:26:56,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:56,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:26:56,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72754279] [2019-12-18 12:26:56,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:26:56,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:56,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:26:56,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:26:56,860 INFO L87 Difference]: Start difference. First operand 21700 states and 67268 transitions. Second operand 12 states. [2019-12-18 12:26:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:57,894 INFO L93 Difference]: Finished difference Result 35737 states and 109819 transitions. [2019-12-18 12:26:57,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:26:57,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:26:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:57,946 INFO L225 Difference]: With dead ends: 35737 [2019-12-18 12:26:57,946 INFO L226 Difference]: Without dead ends: 35526 [2019-12-18 12:26:57,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:26:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35526 states. [2019-12-18 12:26:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35526 to 21524. [2019-12-18 12:26:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21524 states. [2019-12-18 12:26:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21524 states to 21524 states and 66796 transitions. [2019-12-18 12:26:58,381 INFO L78 Accepts]: Start accepts. Automaton has 21524 states and 66796 transitions. Word has length 67 [2019-12-18 12:26:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:58,381 INFO L462 AbstractCegarLoop]: Abstraction has 21524 states and 66796 transitions. [2019-12-18 12:26:58,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:26:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 21524 states and 66796 transitions. [2019-12-18 12:26:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:26:58,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:58,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:58,404 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-18 12:26:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:58,405 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 7 times [2019-12-18 12:26:58,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:58,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553563762] [2019-12-18 12:26:58,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:26:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:26:58,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:26:58,519 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:26:58,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t275~0.base_33| 4)) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t275~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t275~0.base_33|) |v_ULTIMATE.start_main_~#t275~0.offset_23| 0)) |v_#memory_int_19|) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= |v_ULTIMATE.start_main_~#t275~0.offset_23| 0) (= v_~a$mem_tmp~0_14 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t275~0.base_33|)) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t275~0.base_33| 1)) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t275~0.base_33|) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_~#t276~0.base=|v_ULTIMATE.start_main_~#t276~0.base_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ULTIMATE.start_main_~#t276~0.offset=|v_ULTIMATE.start_main_~#t276~0.offset_19|, ULTIMATE.start_main_~#t275~0.offset=|v_ULTIMATE.start_main_~#t275~0.offset_23|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t277~0.base=|v_ULTIMATE.start_main_~#t277~0.base_25|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ULTIMATE.start_main_~#t277~0.offset=|v_ULTIMATE.start_main_~#t277~0.offset_19|, ~y~0=v_~y~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t275~0.base=|v_ULTIMATE.start_main_~#t275~0.base_33|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t276~0.base, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t276~0.offset, ULTIMATE.start_main_~#t275~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t277~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t277~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t275~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 12:26:58,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:26:58,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t276~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t276~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t276~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t276~0.base_12|) |v_ULTIMATE.start_main_~#t276~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t276~0.base_12| 4) |v_#length_15|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t276~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t276~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t276~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t276~0.base=|v_ULTIMATE.start_main_~#t276~0.base_12|, ULTIMATE.start_main_~#t276~0.offset=|v_ULTIMATE.start_main_~#t276~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t276~0.base, ULTIMATE.start_main_~#t276~0.offset] because there is no mapped edge [2019-12-18 12:26:58,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t277~0.base_12| 4)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t277~0.base_12| 1) |v_#valid_32|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t277~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t277~0.base_12|) |v_ULTIMATE.start_main_~#t277~0.offset_10| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t277~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t277~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t277~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t277~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t277~0.base=|v_ULTIMATE.start_main_~#t277~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t277~0.offset=|v_ULTIMATE.start_main_~#t277~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t277~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t277~0.offset] because there is no mapped edge [2019-12-18 12:26:58,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-576333922 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-576333922 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-576333922| ~a$w_buff1~0_In-576333922) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-576333922| ~a~0_In-576333922) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-576333922, ~a$w_buff1~0=~a$w_buff1~0_In-576333922, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-576333922, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576333922} OutVars{~a~0=~a~0_In-576333922, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-576333922|, ~a$w_buff1~0=~a$w_buff1~0_In-576333922, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-576333922, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576333922} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:26:58,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:26:58,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In442648949 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In442648949 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out442648949| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In442648949 |P1Thread1of1ForFork2_#t~ite11_Out442648949|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In442648949, ~a$w_buff0_used~0=~a$w_buff0_used~0_In442648949} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In442648949, ~a$w_buff0_used~0=~a$w_buff0_used~0_In442648949, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out442648949|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:26:58,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1569547599 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1569547599 256) 0))) (or (and (= ~a$w_buff0_used~0_In1569547599 |P0Thread1of1ForFork1_#t~ite5_Out1569547599|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1569547599|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1569547599, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1569547599} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1569547599|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1569547599, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1569547599} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:26:58,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In736979810 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In736979810 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In736979810 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In736979810 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out736979810|)) (and (= ~a$w_buff1_used~0_In736979810 |P0Thread1of1ForFork1_#t~ite6_Out736979810|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In736979810, ~a$w_buff0_used~0=~a$w_buff0_used~0_In736979810, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In736979810, ~a$w_buff1_used~0=~a$w_buff1_used~0_In736979810} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out736979810|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In736979810, ~a$w_buff0_used~0=~a$w_buff0_used~0_In736979810, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In736979810, ~a$w_buff1_used~0=~a$w_buff1_used~0_In736979810} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:26:58,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In2056532424 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2056532424 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In2056532424 ~a$r_buff0_thd1~0_Out2056532424)) (and (= 0 ~a$r_buff0_thd1~0_Out2056532424) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2056532424, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2056532424} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2056532424|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2056532424, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2056532424} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:26:58,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1256804222 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1256804222 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1256804222 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-1256804222 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1256804222| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out-1256804222| ~a$r_buff1_thd1~0_In-1256804222)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1256804222, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1256804222, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1256804222, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1256804222} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1256804222|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1256804222, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1256804222, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1256804222, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1256804222} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:26:58,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:26:58,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In663134038 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In663134038| |P2Thread1of1ForFork0_#t~ite20_Out663134038|) (not .cse0) (= ~a$w_buff0~0_In663134038 |P2Thread1of1ForFork0_#t~ite21_Out663134038|)) (and .cse0 (= ~a$w_buff0~0_In663134038 |P2Thread1of1ForFork0_#t~ite20_Out663134038|) (= |P2Thread1of1ForFork0_#t~ite21_Out663134038| |P2Thread1of1ForFork0_#t~ite20_Out663134038|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In663134038 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In663134038 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In663134038 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In663134038 256)))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In663134038, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In663134038, ~a$w_buff0_used~0=~a$w_buff0_used~0_In663134038, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In663134038, ~a$w_buff1_used~0=~a$w_buff1_used~0_In663134038, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In663134038|, ~weak$$choice2~0=~weak$$choice2~0_In663134038} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out663134038|, ~a$w_buff0~0=~a$w_buff0~0_In663134038, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In663134038, ~a$w_buff0_used~0=~a$w_buff0_used~0_In663134038, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In663134038, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out663134038|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In663134038, ~weak$$choice2~0=~weak$$choice2~0_In663134038} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:26:58,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1407492100 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1407492100 |P2Thread1of1ForFork0_#t~ite26_Out-1407492100|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1407492100 256)))) (or (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In-1407492100 256))) (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1407492100 256))) (= 0 (mod ~a$w_buff0_used~0_In-1407492100 256)))) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out-1407492100| |P2Thread1of1ForFork0_#t~ite26_Out-1407492100|)) (and (not .cse1) (= ~a$w_buff0_used~0_In-1407492100 |P2Thread1of1ForFork0_#t~ite27_Out-1407492100|) (= |P2Thread1of1ForFork0_#t~ite26_In-1407492100| |P2Thread1of1ForFork0_#t~ite26_Out-1407492100|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1407492100|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1407492100, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1407492100, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1407492100, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1407492100, ~weak$$choice2~0=~weak$$choice2~0_In-1407492100} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1407492100|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1407492100|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1407492100, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1407492100, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1407492100, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1407492100, ~weak$$choice2~0=~weak$$choice2~0_In-1407492100} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:26:58,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:26:58,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:26:58,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-239481913 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-239481913 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out-239481913| |P2Thread1of1ForFork0_#t~ite39_Out-239481913|))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-239481913| ~a$w_buff1~0_In-239481913) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out-239481913| ~a~0_In-239481913)))) InVars {~a~0=~a~0_In-239481913, ~a$w_buff1~0=~a$w_buff1~0_In-239481913, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-239481913, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-239481913} OutVars{~a~0=~a~0_In-239481913, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-239481913|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-239481913|, ~a$w_buff1~0=~a$w_buff1~0_In-239481913, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-239481913, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-239481913} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:26:58,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In203184642 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In203184642 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In203184642 |P2Thread1of1ForFork0_#t~ite40_Out203184642|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out203184642|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In203184642, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In203184642} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out203184642|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In203184642, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In203184642} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:26:58,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In204575494 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In204575494 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd3~0_In204575494 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In204575494 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out204575494|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In204575494 |P2Thread1of1ForFork0_#t~ite41_Out204575494|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In204575494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In204575494, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In204575494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In204575494} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In204575494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In204575494, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In204575494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In204575494, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out204575494|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:26:58,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1460961459 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1460961459 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1460961459 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1460961459 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1460961459| ~a$w_buff1_used~0_In-1460961459) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1460961459| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1460961459, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1460961459, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1460961459, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1460961459} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1460961459, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1460961459, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1460961459, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1460961459|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1460961459} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:26:58,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In817327385 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In817327385 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out817327385| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out817327385| ~a$r_buff0_thd2~0_In817327385)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In817327385, ~a$w_buff0_used~0=~a$w_buff0_used~0_In817327385} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In817327385, ~a$w_buff0_used~0=~a$w_buff0_used~0_In817327385, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out817327385|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:26:58,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1308694173 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1308694173 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1308694173 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1308694173 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1308694173| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1308694173| ~a$r_buff1_thd2~0_In-1308694173) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1308694173, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1308694173, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1308694173, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1308694173} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1308694173, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1308694173, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1308694173, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1308694173, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1308694173|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:26:58,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:26:58,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1699700670 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1699700670 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1699700670| ~a$r_buff0_thd3~0_In-1699700670) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1699700670| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1699700670, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1699700670} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1699700670, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1699700670, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1699700670|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:26:58,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-1496072878 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1496072878 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1496072878 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1496072878 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out-1496072878| ~a$r_buff1_thd3~0_In-1496072878) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1496072878| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1496072878, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1496072878, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1496072878, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1496072878} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1496072878|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1496072878, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1496072878, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1496072878, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1496072878} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:26:58,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:26:58,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:26:58,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In224748934 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In224748934 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In224748934 |ULTIMATE.start_main_#t~ite47_Out224748934|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out224748934| ~a$w_buff1~0_In224748934) (not .cse0)))) InVars {~a~0=~a~0_In224748934, ~a$w_buff1~0=~a$w_buff1~0_In224748934, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In224748934, ~a$w_buff1_used~0=~a$w_buff1_used~0_In224748934} OutVars{~a~0=~a~0_In224748934, ~a$w_buff1~0=~a$w_buff1~0_In224748934, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out224748934|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In224748934, ~a$w_buff1_used~0=~a$w_buff1_used~0_In224748934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:26:58,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:26:58,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In344470834 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In344470834 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out344470834| ~a$w_buff0_used~0_In344470834) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out344470834|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In344470834, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In344470834} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In344470834, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out344470834|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In344470834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:26:58,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In834299670 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In834299670 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In834299670 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In834299670 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In834299670 |ULTIMATE.start_main_#t~ite50_Out834299670|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out834299670|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In834299670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In834299670, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In834299670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In834299670} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out834299670|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In834299670, ~a$w_buff0_used~0=~a$w_buff0_used~0_In834299670, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In834299670, ~a$w_buff1_used~0=~a$w_buff1_used~0_In834299670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:26:58,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1370083955 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1370083955 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1370083955| 0)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1370083955| ~a$r_buff0_thd0~0_In-1370083955) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1370083955, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1370083955} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1370083955|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1370083955, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1370083955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:26:58,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-614600237 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-614600237 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-614600237 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-614600237 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-614600237|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In-614600237 |ULTIMATE.start_main_#t~ite52_Out-614600237|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-614600237, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-614600237, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-614600237, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-614600237} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-614600237|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-614600237, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-614600237, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-614600237, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-614600237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:26:58,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:26:58,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:26:58 BasicIcfg [2019-12-18 12:26:58,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:26:58,658 INFO L168 Benchmark]: Toolchain (without parser) took 138939.98 ms. Allocated memory was 139.5 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 103.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 12:26:58,658 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:26:58,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.24 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.7 MB in the beginning and 158.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:58,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.56 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:58,659 INFO L168 Benchmark]: Boogie Preprocessor took 38.24 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:58,660 INFO L168 Benchmark]: RCFGBuilder took 852.34 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 102.0 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:26:58,660 INFO L168 Benchmark]: TraceAbstraction took 137160.33 ms. Allocated memory was 204.5 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 12:26:58,663 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 821.24 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.7 MB in the beginning and 158.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.56 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.24 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.34 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 102.0 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 137160.33 ms. Allocated memory was 204.5 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t275, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t276, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t277, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 136.8s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 44.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11031 SDtfs, 16791 SDslu, 41513 SDs, 0 SdLazy, 19931 SolverSat, 830 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 625 GetRequests, 96 SyntacticMatches, 26 SemanticMatches, 503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2494 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred 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: 60.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 781241 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1975 NumberOfCodeBlocks, 1975 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1871 ConstructedInterpolants, 0 QuantifiedInterpolants, 423595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...