/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:53:32,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:53:32,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:53:32,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:53:32,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:53:32,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:53:32,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:53:32,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:53:32,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:53:32,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:53:32,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:53:32,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:53:32,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:53:32,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:53:32,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:53:32,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:53:32,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:53:32,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:53:32,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:53:32,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:53:32,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:53:32,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:53:32,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:53:32,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:53:32,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:53:32,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:53:32,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:53:32,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:53:32,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:53:32,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:53:32,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:53:32,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:53:32,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:53:32,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:53:32,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:53:32,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:53:32,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:53:32,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:53:32,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:53:32,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:53:32,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:53:32,474 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:53:32,488 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:53:32,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:53:32,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:53:32,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:53:32,490 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:53:32,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:53:32,490 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:53:32,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:53:32,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:53:32,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:53:32,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:53:32,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:53:32,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:53:32,491 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:53:32,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:53:32,492 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:53:32,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:53:32,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:53:32,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:53:32,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:53:32,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:53:32,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:53:32,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:53:32,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:53:32,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:53:32,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:53:32,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:53:32,494 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:53:32,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:53:32,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:53:32,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:53:32,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:53:32,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:53:32,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:53:32,809 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:53:32,810 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2019-12-27 05:53:32,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff03d6db5/695e59484863409db312b3308204bbce/FLAGc4ae7a6b4 [2019-12-27 05:53:33,399 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:53:33,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2019-12-27 05:53:33,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff03d6db5/695e59484863409db312b3308204bbce/FLAGc4ae7a6b4 [2019-12-27 05:53:33,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff03d6db5/695e59484863409db312b3308204bbce [2019-12-27 05:53:33,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:53:33,707 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:53:33,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:53:33,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:53:33,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:53:33,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:53:33" (1/1) ... [2019-12-27 05:53:33,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256d980f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:33, skipping insertion in model container [2019-12-27 05:53:33,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:53:33" (1/1) ... [2019-12-27 05:53:33,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:53:33,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:53:34,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:53:34,397 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:53:34,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:53:34,532 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:53:34,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34 WrapperNode [2019-12-27 05:53:34,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:53:34,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:53:34,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:53:34,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:53:34,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... [2019-12-27 05:53:34,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... [2019-12-27 05:53:34,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:53:34,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:53:34,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:53:34,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:53:34,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... [2019-12-27 05:53:34,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... [2019-12-27 05:53:34,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... [2019-12-27 05:53:34,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... [2019-12-27 05:53:34,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... [2019-12-27 05:53:34,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... [2019-12-27 05:53:34,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... [2019-12-27 05:53:34,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:53:34,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:53:34,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:53:34,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:53:34,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:53:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:53:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:53:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:53:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:53:34,727 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:53:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:53:34,727 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:53:34,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:53:34,728 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:53:34,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:53:34,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:53:34,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:53:34,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:53:34,731 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:53:35,517 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:53:35,518 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:53:35,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:53:35 BoogieIcfgContainer [2019-12-27 05:53:35,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:53:35,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:53:35,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:53:35,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:53:35,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:53:33" (1/3) ... [2019-12-27 05:53:35,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463f16cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:53:35, skipping insertion in model container [2019-12-27 05:53:35,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:34" (2/3) ... [2019-12-27 05:53:35,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463f16cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:53:35, skipping insertion in model container [2019-12-27 05:53:35,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:53:35" (3/3) ... [2019-12-27 05:53:35,532 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_pso.oepc.i [2019-12-27 05:53:35,541 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:53:35,541 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:53:35,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:53:35,553 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:53:35,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,600 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,602 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,602 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,645 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,645 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,681 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,698 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,698 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:35,721 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:53:35,742 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:53:35,742 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:53:35,743 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:53:35,743 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:53:35,743 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:53:35,743 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:53:35,743 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:53:35,743 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:53:35,763 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 05:53:35,765 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:53:35,870 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:53:35,870 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:53:35,887 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:53:35,915 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:53:35,971 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:53:35,972 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:53:35,980 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:53:36,002 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:53:36,003 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:53:39,655 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 05:53:39,809 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 05:53:39,834 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-27 05:53:39,835 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 05:53:39,839 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 05:54:00,777 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-27 05:54:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-27 05:54:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:54:00,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:00,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:54:00,786 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:00,791 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-27 05:54:00,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:00,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966053011] [2019-12-27 05:54:00,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:01,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966053011] [2019-12-27 05:54:01,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:01,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:54:01,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551030829] [2019-12-27 05:54:01,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:01,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:01,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:01,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:01,038 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-27 05:54:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:04,111 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-27 05:54:04,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:04,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:54:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:04,731 INFO L225 Difference]: With dead ends: 120482 [2019-12-27 05:54:04,731 INFO L226 Difference]: Without dead ends: 113384 [2019-12-27 05:54:04,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-27 05:54:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-27 05:54:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-27 05:54:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-27 05:54:15,641 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-27 05:54:15,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:15,642 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-27 05:54:15,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:15,642 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-27 05:54:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:54:15,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:15,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:15,647 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-27 05:54:15,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:15,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202101255] [2019-12-27 05:54:15,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:15,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202101255] [2019-12-27 05:54:15,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:15,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:54:15,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427648996] [2019-12-27 05:54:15,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:54:15,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:54:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:54:15,816 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-27 05:54:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:21,538 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-27 05:54:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:54:21,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:54:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:22,385 INFO L225 Difference]: With dead ends: 179498 [2019-12-27 05:54:22,385 INFO L226 Difference]: Without dead ends: 179449 [2019-12-27 05:54:22,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-27 05:54:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-27 05:54:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-27 05:54:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-27 05:54:39,422 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-27 05:54:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:39,422 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-27 05:54:39,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:54:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-27 05:54:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:54:39,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:39,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:39,430 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-27 05:54:39,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:39,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213660457] [2019-12-27 05:54:39,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:39,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-27 05:54:39,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213660457] [2019-12-27 05:54:39,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:39,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:54:39,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976015406] [2019-12-27 05:54:39,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:39,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:39,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:39,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:39,488 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-27 05:54:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:39,614 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-27 05:54:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:39,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:54:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:39,670 INFO L225 Difference]: With dead ends: 34413 [2019-12-27 05:54:39,670 INFO L226 Difference]: Without dead ends: 34413 [2019-12-27 05:54:39,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-27 05:54:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-27 05:54:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-27 05:54:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-27 05:54:40,422 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-27 05:54:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:40,422 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-27 05:54:40,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-27 05:54:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:54:40,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:40,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:40,425 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-27 05:54:40,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:40,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613005372] [2019-12-27 05:54:40,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:40,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613005372] [2019-12-27 05:54:40,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:40,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:40,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719577608] [2019-12-27 05:54:40,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:40,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:40,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:40,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:40,504 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-27 05:54:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:42,019 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-27 05:54:42,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:42,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 05:54:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:42,113 INFO L225 Difference]: With dead ends: 54627 [2019-12-27 05:54:42,113 INFO L226 Difference]: Without dead ends: 54627 [2019-12-27 05:54:42,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-27 05:54:42,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-27 05:54:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-27 05:54:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-27 05:54:42,939 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-27 05:54:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:42,940 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-27 05:54:42,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-27 05:54:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:54:42,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:42,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:42,944 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-27 05:54:42,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:42,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784618013] [2019-12-27 05:54:42,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:43,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784618013] [2019-12-27 05:54:43,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:43,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:54:43,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757888035] [2019-12-27 05:54:43,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:54:43,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:43,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:54:43,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:54:43,069 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-27 05:54:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:43,482 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-27 05:54:43,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:54:43,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:54:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:43,573 INFO L225 Difference]: With dead ends: 48927 [2019-12-27 05:54:43,574 INFO L226 Difference]: Without dead ends: 48927 [2019-12-27 05:54:43,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-27 05:54:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-27 05:54:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-27 05:54:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-27 05:54:45,197 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-27 05:54:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:45,197 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-27 05:54:45,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:54:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-27 05:54:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:54:45,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:45,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:45,202 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-27 05:54:45,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:45,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924666872] [2019-12-27 05:54:45,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:45,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924666872] [2019-12-27 05:54:45,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:45,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:54:45,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844217898] [2019-12-27 05:54:45,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:54:45,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:45,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:54:45,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:54:45,273 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-27 05:54:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:45,668 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-27 05:54:45,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:54:45,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:54:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:45,759 INFO L225 Difference]: With dead ends: 53251 [2019-12-27 05:54:45,759 INFO L226 Difference]: Without dead ends: 53251 [2019-12-27 05:54:45,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-27 05:54:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-27 05:54:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-27 05:54:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-27 05:54:49,411 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-27 05:54:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:49,411 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-27 05:54:49,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:54:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-27 05:54:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:54:49,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:49,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:49,420 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:49,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:49,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-27 05:54:49,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:49,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144239512] [2019-12-27 05:54:49,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:49,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144239512] [2019-12-27 05:54:49,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:49,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:54:49,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639888843] [2019-12-27 05:54:49,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:54:49,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:49,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:54:49,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:54:49,568 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 6 states. [2019-12-27 05:54:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:50,512 INFO L93 Difference]: Finished difference Result 63407 states and 201418 transitions. [2019-12-27 05:54:50,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:54:50,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 05:54:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:50,623 INFO L225 Difference]: With dead ends: 63407 [2019-12-27 05:54:50,623 INFO L226 Difference]: Without dead ends: 63400 [2019-12-27 05:54:50,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:54:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63400 states. [2019-12-27 05:54:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63400 to 47584. [2019-12-27 05:54:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47584 states. [2019-12-27 05:54:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47584 states to 47584 states and 154270 transitions. [2019-12-27 05:54:52,032 INFO L78 Accepts]: Start accepts. Automaton has 47584 states and 154270 transitions. Word has length 22 [2019-12-27 05:54:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:52,033 INFO L462 AbstractCegarLoop]: Abstraction has 47584 states and 154270 transitions. [2019-12-27 05:54:52,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:54:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 47584 states and 154270 transitions. [2019-12-27 05:54:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:54:52,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:52,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:52,042 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:52,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:52,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-27 05:54:52,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:52,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662840349] [2019-12-27 05:54:52,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:52,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662840349] [2019-12-27 05:54:52,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:52,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:52,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041899906] [2019-12-27 05:54:52,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:54:52,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:52,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:54:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:52,123 INFO L87 Difference]: Start difference. First operand 47584 states and 154270 transitions. Second operand 5 states. [2019-12-27 05:54:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:52,985 INFO L93 Difference]: Finished difference Result 66059 states and 208933 transitions. [2019-12-27 05:54:52,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:54:52,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:54:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:53,151 INFO L225 Difference]: With dead ends: 66059 [2019-12-27 05:54:53,152 INFO L226 Difference]: Without dead ends: 66052 [2019-12-27 05:54:53,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:54:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66052 states. [2019-12-27 05:54:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66052 to 46168. [2019-12-27 05:54:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46168 states. [2019-12-27 05:54:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46168 states to 46168 states and 149707 transitions. [2019-12-27 05:54:54,146 INFO L78 Accepts]: Start accepts. Automaton has 46168 states and 149707 transitions. Word has length 22 [2019-12-27 05:54:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:54,146 INFO L462 AbstractCegarLoop]: Abstraction has 46168 states and 149707 transitions. [2019-12-27 05:54:54,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:54:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 46168 states and 149707 transitions. [2019-12-27 05:54:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:54:54,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:54,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:54,158 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:54,158 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-27 05:54:54,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:54,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814884652] [2019-12-27 05:54:54,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:54,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814884652] [2019-12-27 05:54:54,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:54,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:54,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329338045] [2019-12-27 05:54:54,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:54:54,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:54:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:54:54,202 INFO L87 Difference]: Start difference. First operand 46168 states and 149707 transitions. Second operand 4 states. [2019-12-27 05:54:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:54,615 INFO L93 Difference]: Finished difference Result 17945 states and 54933 transitions. [2019-12-27 05:54:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:54:54,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:54:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:54,646 INFO L225 Difference]: With dead ends: 17945 [2019-12-27 05:54:54,646 INFO L226 Difference]: Without dead ends: 17945 [2019-12-27 05:54:54,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:54:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17945 states. [2019-12-27 05:54:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17945 to 17582. [2019-12-27 05:54:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17582 states. [2019-12-27 05:54:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17582 states to 17582 states and 53897 transitions. [2019-12-27 05:54:54,905 INFO L78 Accepts]: Start accepts. Automaton has 17582 states and 53897 transitions. Word has length 25 [2019-12-27 05:54:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:54,906 INFO L462 AbstractCegarLoop]: Abstraction has 17582 states and 53897 transitions. [2019-12-27 05:54:54,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:54:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17582 states and 53897 transitions. [2019-12-27 05:54:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 05:54:54,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:54,917 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] [2019-12-27 05:54:54,917 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1225408676, now seen corresponding path program 1 times [2019-12-27 05:54:54,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:54,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195494184] [2019-12-27 05:54:54,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:54,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195494184] [2019-12-27 05:54:54,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:54,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:54:55,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063493771] [2019-12-27 05:54:55,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:54:55,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:55,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:54:55,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:54:55,001 INFO L87 Difference]: Start difference. First operand 17582 states and 53897 transitions. Second operand 6 states. [2019-12-27 05:54:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:55,538 INFO L93 Difference]: Finished difference Result 23296 states and 70043 transitions. [2019-12-27 05:54:55,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:54:55,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 05:54:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:55,572 INFO L225 Difference]: With dead ends: 23296 [2019-12-27 05:54:55,572 INFO L226 Difference]: Without dead ends: 23296 [2019-12-27 05:54:55,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:54:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23296 states. [2019-12-27 05:54:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23296 to 17427. [2019-12-27 05:54:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17427 states. [2019-12-27 05:54:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17427 states to 17427 states and 53433 transitions. [2019-12-27 05:54:55,861 INFO L78 Accepts]: Start accepts. Automaton has 17427 states and 53433 transitions. Word has length 26 [2019-12-27 05:54:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:55,861 INFO L462 AbstractCegarLoop]: Abstraction has 17427 states and 53433 transitions. [2019-12-27 05:54:55,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:54:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17427 states and 53433 transitions. [2019-12-27 05:54:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:54:55,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:55,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:55,874 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-27 05:54:55,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:55,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843388951] [2019-12-27 05:54:55,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:56,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843388951] [2019-12-27 05:54:56,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:56,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:56,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197145508] [2019-12-27 05:54:56,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:54:56,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:56,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:54:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:56,005 INFO L87 Difference]: Start difference. First operand 17427 states and 53433 transitions. Second operand 5 states. [2019-12-27 05:54:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:56,351 INFO L93 Difference]: Finished difference Result 22078 states and 66571 transitions. [2019-12-27 05:54:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:54:56,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 05:54:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:56,385 INFO L225 Difference]: With dead ends: 22078 [2019-12-27 05:54:56,386 INFO L226 Difference]: Without dead ends: 22078 [2019-12-27 05:54:56,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:54:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22078 states. [2019-12-27 05:54:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22078 to 20690. [2019-12-27 05:54:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20690 states. [2019-12-27 05:54:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 63081 transitions. [2019-12-27 05:54:56,725 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 63081 transitions. Word has length 27 [2019-12-27 05:54:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:56,726 INFO L462 AbstractCegarLoop]: Abstraction has 20690 states and 63081 transitions. [2019-12-27 05:54:56,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:54:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 63081 transitions. [2019-12-27 05:54:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:54:56,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:56,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:56,741 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:56,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:56,741 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-27 05:54:56,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:56,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256150070] [2019-12-27 05:54:56,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:56,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256150070] [2019-12-27 05:54:56,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:56,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:54:56,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606010574] [2019-12-27 05:54:56,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:54:56,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:54:56,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:56,828 INFO L87 Difference]: Start difference. First operand 20690 states and 63081 transitions. Second operand 5 states. [2019-12-27 05:54:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:57,070 INFO L93 Difference]: Finished difference Result 21192 states and 64416 transitions. [2019-12-27 05:54:57,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:54:57,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:54:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:57,120 INFO L225 Difference]: With dead ends: 21192 [2019-12-27 05:54:57,120 INFO L226 Difference]: Without dead ends: 21192 [2019-12-27 05:54:57,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21192 states. [2019-12-27 05:54:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21192 to 21192. [2019-12-27 05:54:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21192 states. [2019-12-27 05:54:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21192 states to 21192 states and 64416 transitions. [2019-12-27 05:54:57,481 INFO L78 Accepts]: Start accepts. Automaton has 21192 states and 64416 transitions. Word has length 28 [2019-12-27 05:54:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:57,481 INFO L462 AbstractCegarLoop]: Abstraction has 21192 states and 64416 transitions. [2019-12-27 05:54:57,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:54:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 21192 states and 64416 transitions. [2019-12-27 05:54:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 05:54:57,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:57,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:57,497 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:57,498 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-27 05:54:57,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:57,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970937032] [2019-12-27 05:54:57,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:57,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970937032] [2019-12-27 05:54:57,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:57,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:57,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481207349] [2019-12-27 05:54:57,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:54:57,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:54:57,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:57,582 INFO L87 Difference]: Start difference. First operand 21192 states and 64416 transitions. Second operand 5 states. [2019-12-27 05:54:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:57,917 INFO L93 Difference]: Finished difference Result 24492 states and 73329 transitions. [2019-12-27 05:54:57,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:54:57,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 05:54:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:57,960 INFO L225 Difference]: With dead ends: 24492 [2019-12-27 05:54:57,960 INFO L226 Difference]: Without dead ends: 24492 [2019-12-27 05:54:57,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:54:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24492 states. [2019-12-27 05:54:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24492 to 20516. [2019-12-27 05:54:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-27 05:54:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 62487 transitions. [2019-12-27 05:54:58,294 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 62487 transitions. Word has length 29 [2019-12-27 05:54:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:58,295 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 62487 transitions. [2019-12-27 05:54:58,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:54:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 62487 transitions. [2019-12-27 05:54:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:54:58,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:58,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] [2019-12-27 05:54:58,316 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:58,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-27 05:54:58,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:58,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766329130] [2019-12-27 05:54:58,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:58,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-27 05:54:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766329130] [2019-12-27 05:54:58,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:58,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:54:58,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656427127] [2019-12-27 05:54:58,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:54:58,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:58,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:54:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:54:58,471 INFO L87 Difference]: Start difference. First operand 20516 states and 62487 transitions. Second operand 7 states. [2019-12-27 05:54:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:59,302 INFO L93 Difference]: Finished difference Result 30060 states and 89581 transitions. [2019-12-27 05:54:59,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 05:54:59,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 05:54:59,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:59,348 INFO L225 Difference]: With dead ends: 30060 [2019-12-27 05:54:59,348 INFO L226 Difference]: Without dead ends: 30060 [2019-12-27 05:54:59,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:54:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30060 states. [2019-12-27 05:54:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30060 to 22850. [2019-12-27 05:54:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22850 states. [2019-12-27 05:54:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22850 states to 22850 states and 69400 transitions. [2019-12-27 05:54:59,851 INFO L78 Accepts]: Start accepts. Automaton has 22850 states and 69400 transitions. Word has length 33 [2019-12-27 05:54:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:59,851 INFO L462 AbstractCegarLoop]: Abstraction has 22850 states and 69400 transitions. [2019-12-27 05:54:59,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:54:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 22850 states and 69400 transitions. [2019-12-27 05:54:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 05:54:59,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:59,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:59,871 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-27 05:54:59,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:59,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185389304] [2019-12-27 05:54:59,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:00,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185389304] [2019-12-27 05:55:00,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:00,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:55:00,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492256922] [2019-12-27 05:55:00,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:55:00,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:00,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:55:00,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:55:00,015 INFO L87 Difference]: Start difference. First operand 22850 states and 69400 transitions. Second operand 7 states. [2019-12-27 05:55:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:00,989 INFO L93 Difference]: Finished difference Result 31602 states and 94253 transitions. [2019-12-27 05:55:00,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 05:55:00,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 05:55:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:01,038 INFO L225 Difference]: With dead ends: 31602 [2019-12-27 05:55:01,038 INFO L226 Difference]: Without dead ends: 31602 [2019-12-27 05:55:01,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:55:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31602 states. [2019-12-27 05:55:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31602 to 21638. [2019-12-27 05:55:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21638 states. [2019-12-27 05:55:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21638 states to 21638 states and 65897 transitions. [2019-12-27 05:55:01,448 INFO L78 Accepts]: Start accepts. Automaton has 21638 states and 65897 transitions. Word has length 35 [2019-12-27 05:55:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:01,448 INFO L462 AbstractCegarLoop]: Abstraction has 21638 states and 65897 transitions. [2019-12-27 05:55:01,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:55:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 21638 states and 65897 transitions. [2019-12-27 05:55:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:55:01,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:01,467 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] [2019-12-27 05:55:01,467 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:01,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1061116233, now seen corresponding path program 1 times [2019-12-27 05:55:01,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:01,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802692552] [2019-12-27 05:55:01,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:01,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802692552] [2019-12-27 05:55:01,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:01,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:55:01,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606994387] [2019-12-27 05:55:01,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:55:01,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:55:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:55:01,554 INFO L87 Difference]: Start difference. First operand 21638 states and 65897 transitions. Second operand 6 states. [2019-12-27 05:55:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:02,285 INFO L93 Difference]: Finished difference Result 29454 states and 87497 transitions. [2019-12-27 05:55:02,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:55:02,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 05:55:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:02,328 INFO L225 Difference]: With dead ends: 29454 [2019-12-27 05:55:02,328 INFO L226 Difference]: Without dead ends: 29454 [2019-12-27 05:55:02,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:55:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29454 states. [2019-12-27 05:55:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29454 to 21696. [2019-12-27 05:55:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21696 states. [2019-12-27 05:55:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 65742 transitions. [2019-12-27 05:55:02,720 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 65742 transitions. Word has length 37 [2019-12-27 05:55:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:02,720 INFO L462 AbstractCegarLoop]: Abstraction has 21696 states and 65742 transitions. [2019-12-27 05:55:02,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:55:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 65742 transitions. [2019-12-27 05:55:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:55:02,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:02,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:02,749 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-27 05:55:02,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:02,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48490597] [2019-12-27 05:55:02,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:02,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48490597] [2019-12-27 05:55:02,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:02,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:02,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267697339] [2019-12-27 05:55:02,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:02,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:02,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:02,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:02,976 INFO L87 Difference]: Start difference. First operand 21696 states and 65742 transitions. Second operand 3 states. [2019-12-27 05:55:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:03,136 INFO L93 Difference]: Finished difference Result 41236 states and 125000 transitions. [2019-12-27 05:55:03,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:03,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:55:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:03,178 INFO L225 Difference]: With dead ends: 41236 [2019-12-27 05:55:03,178 INFO L226 Difference]: Without dead ends: 22394 [2019-12-27 05:55:03,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22394 states. [2019-12-27 05:55:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22394 to 22213. [2019-12-27 05:55:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22213 states. [2019-12-27 05:55:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22213 states to 22213 states and 65657 transitions. [2019-12-27 05:55:03,514 INFO L78 Accepts]: Start accepts. Automaton has 22213 states and 65657 transitions. Word has length 39 [2019-12-27 05:55:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:03,514 INFO L462 AbstractCegarLoop]: Abstraction has 22213 states and 65657 transitions. [2019-12-27 05:55:03,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22213 states and 65657 transitions. [2019-12-27 05:55:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:55:03,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:03,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:03,543 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash 252616620, now seen corresponding path program 1 times [2019-12-27 05:55:03,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:03,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709054817] [2019-12-27 05:55:03,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:03,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709054817] [2019-12-27 05:55:03,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:03,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:55:03,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261693547] [2019-12-27 05:55:03,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:55:03,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:03,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:55:03,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:55:03,629 INFO L87 Difference]: Start difference. First operand 22213 states and 65657 transitions. Second operand 6 states. [2019-12-27 05:55:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:04,290 INFO L93 Difference]: Finished difference Result 28526 states and 82897 transitions. [2019-12-27 05:55:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:55:04,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 05:55:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:04,329 INFO L225 Difference]: With dead ends: 28526 [2019-12-27 05:55:04,329 INFO L226 Difference]: Without dead ends: 28526 [2019-12-27 05:55:04,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:55:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28526 states. [2019-12-27 05:55:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28526 to 18887. [2019-12-27 05:55:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18887 states. [2019-12-27 05:55:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18887 states to 18887 states and 56307 transitions. [2019-12-27 05:55:04,670 INFO L78 Accepts]: Start accepts. Automaton has 18887 states and 56307 transitions. Word has length 39 [2019-12-27 05:55:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:04,670 INFO L462 AbstractCegarLoop]: Abstraction has 18887 states and 56307 transitions. [2019-12-27 05:55:04,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:55:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 18887 states and 56307 transitions. [2019-12-27 05:55:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:55:04,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:04,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:04,690 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-27 05:55:04,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:04,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011940120] [2019-12-27 05:55:04,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:04,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011940120] [2019-12-27 05:55:04,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:04,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:55:04,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377661910] [2019-12-27 05:55:04,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:55:04,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:04,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:55:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:04,761 INFO L87 Difference]: Start difference. First operand 18887 states and 56307 transitions. Second operand 5 states. [2019-12-27 05:55:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:05,361 INFO L93 Difference]: Finished difference Result 26904 states and 79447 transitions. [2019-12-27 05:55:05,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:55:05,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:55:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:05,402 INFO L225 Difference]: With dead ends: 26904 [2019-12-27 05:55:05,403 INFO L226 Difference]: Without dead ends: 26904 [2019-12-27 05:55:05,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:55:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26904 states. [2019-12-27 05:55:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26904 to 24960. [2019-12-27 05:55:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24960 states. [2019-12-27 05:55:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24960 states to 24960 states and 74241 transitions. [2019-12-27 05:55:05,934 INFO L78 Accepts]: Start accepts. Automaton has 24960 states and 74241 transitions. Word has length 40 [2019-12-27 05:55:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:05,934 INFO L462 AbstractCegarLoop]: Abstraction has 24960 states and 74241 transitions. [2019-12-27 05:55:05,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:55:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 24960 states and 74241 transitions. [2019-12-27 05:55:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:55:05,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:05,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:05,959 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:05,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-27 05:55:05,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:05,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478755231] [2019-12-27 05:55:05,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:06,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478755231] [2019-12-27 05:55:06,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:06,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:55:06,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505570675] [2019-12-27 05:55:06,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:55:06,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:06,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:55:06,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:06,007 INFO L87 Difference]: Start difference. First operand 24960 states and 74241 transitions. Second operand 5 states. [2019-12-27 05:55:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:06,109 INFO L93 Difference]: Finished difference Result 23504 states and 70873 transitions. [2019-12-27 05:55:06,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:55:06,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:55:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:06,139 INFO L225 Difference]: With dead ends: 23504 [2019-12-27 05:55:06,139 INFO L226 Difference]: Without dead ends: 21710 [2019-12-27 05:55:06,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21710 states. [2019-12-27 05:55:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21710 to 20786. [2019-12-27 05:55:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20786 states. [2019-12-27 05:55:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20786 states to 20786 states and 64480 transitions. [2019-12-27 05:55:06,467 INFO L78 Accepts]: Start accepts. Automaton has 20786 states and 64480 transitions. Word has length 40 [2019-12-27 05:55:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:06,467 INFO L462 AbstractCegarLoop]: Abstraction has 20786 states and 64480 transitions. [2019-12-27 05:55:06,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:55:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 20786 states and 64480 transitions. [2019-12-27 05:55:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:55:06,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:06,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:06,489 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:06,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1469321779, now seen corresponding path program 1 times [2019-12-27 05:55:06,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:06,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277070318] [2019-12-27 05:55:06,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:06,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277070318] [2019-12-27 05:55:06,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:06,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:55:06,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180511222] [2019-12-27 05:55:06,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:55:06,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:06,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:55:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:55:06,567 INFO L87 Difference]: Start difference. First operand 20786 states and 64480 transitions. Second operand 7 states. [2019-12-27 05:55:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:07,123 INFO L93 Difference]: Finished difference Result 58414 states and 180762 transitions. [2019-12-27 05:55:07,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 05:55:07,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:55:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:07,209 INFO L225 Difference]: With dead ends: 58414 [2019-12-27 05:55:07,209 INFO L226 Difference]: Without dead ends: 45426 [2019-12-27 05:55:07,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:55:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45426 states. [2019-12-27 05:55:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45426 to 23437. [2019-12-27 05:55:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23437 states. [2019-12-27 05:55:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23437 states to 23437 states and 73414 transitions. [2019-12-27 05:55:07,797 INFO L78 Accepts]: Start accepts. Automaton has 23437 states and 73414 transitions. Word has length 64 [2019-12-27 05:55:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:07,797 INFO L462 AbstractCegarLoop]: Abstraction has 23437 states and 73414 transitions. [2019-12-27 05:55:07,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:55:07,797 INFO L276 IsEmpty]: Start isEmpty. Operand 23437 states and 73414 transitions. [2019-12-27 05:55:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:55:07,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:07,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:07,824 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:07,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash 572317973, now seen corresponding path program 2 times [2019-12-27 05:55:07,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:07,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388340162] [2019-12-27 05:55:07,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:07,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388340162] [2019-12-27 05:55:07,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:07,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:55:07,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356663400] [2019-12-27 05:55:07,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:55:07,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:55:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:55:07,900 INFO L87 Difference]: Start difference. First operand 23437 states and 73414 transitions. Second operand 7 states. [2019-12-27 05:55:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:08,824 INFO L93 Difference]: Finished difference Result 67147 states and 206218 transitions. [2019-12-27 05:55:08,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:55:08,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:55:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:08,890 INFO L225 Difference]: With dead ends: 67147 [2019-12-27 05:55:08,890 INFO L226 Difference]: Without dead ends: 46532 [2019-12-27 05:55:08,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:55:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46532 states. [2019-12-27 05:55:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46532 to 26865. [2019-12-27 05:55:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26865 states. [2019-12-27 05:55:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26865 states to 26865 states and 83940 transitions. [2019-12-27 05:55:09,462 INFO L78 Accepts]: Start accepts. Automaton has 26865 states and 83940 transitions. Word has length 64 [2019-12-27 05:55:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:09,462 INFO L462 AbstractCegarLoop]: Abstraction has 26865 states and 83940 transitions. [2019-12-27 05:55:09,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:55:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 26865 states and 83940 transitions. [2019-12-27 05:55:09,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:55:09,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:09,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:09,497 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:09,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:09,497 INFO L82 PathProgramCache]: Analyzing trace with hash 584356249, now seen corresponding path program 3 times [2019-12-27 05:55:09,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:09,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394734710] [2019-12-27 05:55:09,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:09,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394734710] [2019-12-27 05:55:09,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:09,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:55:09,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543650421] [2019-12-27 05:55:09,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:55:09,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:55:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:55:09,577 INFO L87 Difference]: Start difference. First operand 26865 states and 83940 transitions. Second operand 7 states. [2019-12-27 05:55:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:10,035 INFO L93 Difference]: Finished difference Result 57473 states and 176948 transitions. [2019-12-27 05:55:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:55:10,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:55:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:10,110 INFO L225 Difference]: With dead ends: 57473 [2019-12-27 05:55:10,110 INFO L226 Difference]: Without dead ends: 49915 [2019-12-27 05:55:10,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:55:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49915 states. [2019-12-27 05:55:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49915 to 27173. [2019-12-27 05:55:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27173 states. [2019-12-27 05:55:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27173 states to 27173 states and 84891 transitions. [2019-12-27 05:55:10,703 INFO L78 Accepts]: Start accepts. Automaton has 27173 states and 84891 transitions. Word has length 64 [2019-12-27 05:55:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:10,703 INFO L462 AbstractCegarLoop]: Abstraction has 27173 states and 84891 transitions. [2019-12-27 05:55:10,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:55:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27173 states and 84891 transitions. [2019-12-27 05:55:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:55:10,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:10,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:10,732 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1340586405, now seen corresponding path program 4 times [2019-12-27 05:55:10,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:10,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87214509] [2019-12-27 05:55:10,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:10,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87214509] [2019-12-27 05:55:10,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:10,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:10,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896699664] [2019-12-27 05:55:10,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:10,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:10,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:10,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:10,797 INFO L87 Difference]: Start difference. First operand 27173 states and 84891 transitions. Second operand 3 states. [2019-12-27 05:55:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:11,150 INFO L93 Difference]: Finished difference Result 33052 states and 101911 transitions. [2019-12-27 05:55:11,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:11,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:55:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:11,194 INFO L225 Difference]: With dead ends: 33052 [2019-12-27 05:55:11,194 INFO L226 Difference]: Without dead ends: 33052 [2019-12-27 05:55:11,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33052 states. [2019-12-27 05:55:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33052 to 28751. [2019-12-27 05:55:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28751 states. [2019-12-27 05:55:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28751 states to 28751 states and 89506 transitions. [2019-12-27 05:55:11,676 INFO L78 Accepts]: Start accepts. Automaton has 28751 states and 89506 transitions. Word has length 64 [2019-12-27 05:55:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:11,676 INFO L462 AbstractCegarLoop]: Abstraction has 28751 states and 89506 transitions. [2019-12-27 05:55:11,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28751 states and 89506 transitions. [2019-12-27 05:55:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:55:11,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:11,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:11,708 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:11,709 INFO L82 PathProgramCache]: Analyzing trace with hash -87540519, now seen corresponding path program 1 times [2019-12-27 05:55:11,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:11,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160990642] [2019-12-27 05:55:11,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:11,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160990642] [2019-12-27 05:55:11,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:11,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:55:11,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118073599] [2019-12-27 05:55:11,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:55:11,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:11,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:55:11,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:55:11,955 INFO L87 Difference]: Start difference. First operand 28751 states and 89506 transitions. Second operand 10 states. [2019-12-27 05:55:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:14,692 INFO L93 Difference]: Finished difference Result 51352 states and 155361 transitions. [2019-12-27 05:55:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 05:55:14,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 05:55:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:14,762 INFO L225 Difference]: With dead ends: 51352 [2019-12-27 05:55:14,762 INFO L226 Difference]: Without dead ends: 50972 [2019-12-27 05:55:14,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 05:55:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50972 states. [2019-12-27 05:55:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50972 to 33220. [2019-12-27 05:55:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33220 states. [2019-12-27 05:55:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33220 states to 33220 states and 102478 transitions. [2019-12-27 05:55:15,689 INFO L78 Accepts]: Start accepts. Automaton has 33220 states and 102478 transitions. Word has length 65 [2019-12-27 05:55:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:15,690 INFO L462 AbstractCegarLoop]: Abstraction has 33220 states and 102478 transitions. [2019-12-27 05:55:15,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:55:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 33220 states and 102478 transitions. [2019-12-27 05:55:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:55:15,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:15,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:15,726 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:15,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:15,726 INFO L82 PathProgramCache]: Analyzing trace with hash -801818747, now seen corresponding path program 2 times [2019-12-27 05:55:15,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:15,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393632746] [2019-12-27 05:55:15,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:15,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393632746] [2019-12-27 05:55:15,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:15,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:15,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108411000] [2019-12-27 05:55:15,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:15,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:15,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:15,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:15,789 INFO L87 Difference]: Start difference. First operand 33220 states and 102478 transitions. Second operand 3 states. [2019-12-27 05:55:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:15,904 INFO L93 Difference]: Finished difference Result 33219 states and 102476 transitions. [2019-12-27 05:55:15,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:15,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:55:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:15,954 INFO L225 Difference]: With dead ends: 33219 [2019-12-27 05:55:15,954 INFO L226 Difference]: Without dead ends: 33219 [2019-12-27 05:55:15,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33219 states. [2019-12-27 05:55:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33219 to 26459. [2019-12-27 05:55:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26459 states. [2019-12-27 05:55:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26459 states to 26459 states and 82941 transitions. [2019-12-27 05:55:16,456 INFO L78 Accepts]: Start accepts. Automaton has 26459 states and 82941 transitions. Word has length 65 [2019-12-27 05:55:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:16,456 INFO L462 AbstractCegarLoop]: Abstraction has 26459 states and 82941 transitions. [2019-12-27 05:55:16,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 26459 states and 82941 transitions. [2019-12-27 05:55:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:55:16,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:16,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:16,490 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:16,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2032409417, now seen corresponding path program 1 times [2019-12-27 05:55:16,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:16,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421288880] [2019-12-27 05:55:16,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:16,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421288880] [2019-12-27 05:55:16,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:16,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:16,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162520194] [2019-12-27 05:55:16,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:16,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:16,566 INFO L87 Difference]: Start difference. First operand 26459 states and 82941 transitions. Second operand 3 states. [2019-12-27 05:55:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:16,672 INFO L93 Difference]: Finished difference Result 23264 states and 71613 transitions. [2019-12-27 05:55:16,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:16,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:55:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:16,715 INFO L225 Difference]: With dead ends: 23264 [2019-12-27 05:55:16,716 INFO L226 Difference]: Without dead ends: 23264 [2019-12-27 05:55:16,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23264 states. [2019-12-27 05:55:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23264 to 22289. [2019-12-27 05:55:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22289 states. [2019-12-27 05:55:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22289 states to 22289 states and 68538 transitions. [2019-12-27 05:55:17,068 INFO L78 Accepts]: Start accepts. Automaton has 22289 states and 68538 transitions. Word has length 66 [2019-12-27 05:55:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:17,069 INFO L462 AbstractCegarLoop]: Abstraction has 22289 states and 68538 transitions. [2019-12-27 05:55:17,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 22289 states and 68538 transitions. [2019-12-27 05:55:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:55:17,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:17,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:17,099 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:17,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1309527475, now seen corresponding path program 1 times [2019-12-27 05:55:17,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:17,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50917062] [2019-12-27 05:55:17,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:17,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50917062] [2019-12-27 05:55:17,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:17,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:55:17,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836055354] [2019-12-27 05:55:17,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:55:17,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:55:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:55:17,708 INFO L87 Difference]: Start difference. First operand 22289 states and 68538 transitions. Second operand 16 states. [2019-12-27 05:55:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:21,266 INFO L93 Difference]: Finished difference Result 29119 states and 88734 transitions. [2019-12-27 05:55:21,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 05:55:21,266 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 05:55:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:21,308 INFO L225 Difference]: With dead ends: 29119 [2019-12-27 05:55:21,308 INFO L226 Difference]: Without dead ends: 28118 [2019-12-27 05:55:21,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 05:55:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28118 states. [2019-12-27 05:55:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28118 to 24589. [2019-12-27 05:55:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24589 states. [2019-12-27 05:55:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24589 states to 24589 states and 75473 transitions. [2019-12-27 05:55:21,727 INFO L78 Accepts]: Start accepts. Automaton has 24589 states and 75473 transitions. Word has length 67 [2019-12-27 05:55:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:21,727 INFO L462 AbstractCegarLoop]: Abstraction has 24589 states and 75473 transitions. [2019-12-27 05:55:21,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:55:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 24589 states and 75473 transitions. [2019-12-27 05:55:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:55:21,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:21,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:21,758 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:21,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:21,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1955892329, now seen corresponding path program 2 times [2019-12-27 05:55:21,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:21,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967385670] [2019-12-27 05:55:21,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:22,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967385670] [2019-12-27 05:55:22,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:22,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:55:22,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438360829] [2019-12-27 05:55:22,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:55:22,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:55:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:55:22,237 INFO L87 Difference]: Start difference. First operand 24589 states and 75473 transitions. Second operand 15 states. [2019-12-27 05:55:26,585 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-27 05:55:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:27,119 INFO L93 Difference]: Finished difference Result 52141 states and 157692 transitions. [2019-12-27 05:55:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 05:55:27,119 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 05:55:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:27,174 INFO L225 Difference]: With dead ends: 52141 [2019-12-27 05:55:27,174 INFO L226 Difference]: Without dead ends: 42623 [2019-12-27 05:55:27,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=2787, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 05:55:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42623 states. [2019-12-27 05:55:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42623 to 22751. [2019-12-27 05:55:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22751 states. [2019-12-27 05:55:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22751 states to 22751 states and 69696 transitions. [2019-12-27 05:55:27,653 INFO L78 Accepts]: Start accepts. Automaton has 22751 states and 69696 transitions. Word has length 67 [2019-12-27 05:55:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:27,654 INFO L462 AbstractCegarLoop]: Abstraction has 22751 states and 69696 transitions. [2019-12-27 05:55:27,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:55:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 22751 states and 69696 transitions. [2019-12-27 05:55:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:55:27,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:27,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:27,676 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1532450363, now seen corresponding path program 3 times [2019-12-27 05:55:27,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:27,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425904604] [2019-12-27 05:55:27,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:28,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425904604] [2019-12-27 05:55:28,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:28,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 05:55:28,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664156607] [2019-12-27 05:55:28,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 05:55:28,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 05:55:28,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:55:28,384 INFO L87 Difference]: Start difference. First operand 22751 states and 69696 transitions. Second operand 18 states. [2019-12-27 05:55:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:34,277 INFO L93 Difference]: Finished difference Result 42105 states and 126497 transitions. [2019-12-27 05:55:34,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 05:55:34,278 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 05:55:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:34,318 INFO L225 Difference]: With dead ends: 42105 [2019-12-27 05:55:34,318 INFO L226 Difference]: Without dead ends: 32579 [2019-12-27 05:55:34,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=611, Invalid=3049, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 05:55:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32579 states. [2019-12-27 05:55:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32579 to 23444. [2019-12-27 05:55:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23444 states. [2019-12-27 05:55:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23444 states to 23444 states and 71292 transitions. [2019-12-27 05:55:34,732 INFO L78 Accepts]: Start accepts. Automaton has 23444 states and 71292 transitions. Word has length 67 [2019-12-27 05:55:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:34,732 INFO L462 AbstractCegarLoop]: Abstraction has 23444 states and 71292 transitions. [2019-12-27 05:55:34,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 05:55:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 23444 states and 71292 transitions. [2019-12-27 05:55:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:55:34,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:34,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:34,759 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2146626547, now seen corresponding path program 4 times [2019-12-27 05:55:34,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:34,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080366344] [2019-12-27 05:55:34,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:34,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080366344] [2019-12-27 05:55:34,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:34,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:55:34,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278779067] [2019-12-27 05:55:34,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:55:34,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:34,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:55:34,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:55:34,929 INFO L87 Difference]: Start difference. First operand 23444 states and 71292 transitions. Second operand 11 states. [2019-12-27 05:55:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:36,113 INFO L93 Difference]: Finished difference Result 47830 states and 146269 transitions. [2019-12-27 05:55:36,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 05:55:36,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:55:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:36,180 INFO L225 Difference]: With dead ends: 47830 [2019-12-27 05:55:36,180 INFO L226 Difference]: Without dead ends: 45137 [2019-12-27 05:55:36,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:55:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45137 states. [2019-12-27 05:55:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45137 to 27969. [2019-12-27 05:55:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27969 states. [2019-12-27 05:55:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27969 states to 27969 states and 85447 transitions. [2019-12-27 05:55:36,770 INFO L78 Accepts]: Start accepts. Automaton has 27969 states and 85447 transitions. Word has length 67 [2019-12-27 05:55:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:36,771 INFO L462 AbstractCegarLoop]: Abstraction has 27969 states and 85447 transitions. [2019-12-27 05:55:36,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:55:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 27969 states and 85447 transitions. [2019-12-27 05:55:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:55:36,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:36,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:36,802 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1501975895, now seen corresponding path program 5 times [2019-12-27 05:55:36,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:36,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558414705] [2019-12-27 05:55:36,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:37,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558414705] [2019-12-27 05:55:37,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:37,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 05:55:37,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764964175] [2019-12-27 05:55:37,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 05:55:37,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 05:55:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:55:37,411 INFO L87 Difference]: Start difference. First operand 27969 states and 85447 transitions. Second operand 18 states. [2019-12-27 05:55:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:41,926 INFO L93 Difference]: Finished difference Result 36762 states and 110747 transitions. [2019-12-27 05:55:41,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 05:55:41,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 05:55:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:41,972 INFO L225 Difference]: With dead ends: 36762 [2019-12-27 05:55:41,972 INFO L226 Difference]: Without dead ends: 32211 [2019-12-27 05:55:41,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=504, Invalid=2688, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 05:55:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32211 states. [2019-12-27 05:55:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32211 to 27631. [2019-12-27 05:55:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27631 states. [2019-12-27 05:55:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 84552 transitions. [2019-12-27 05:55:42,453 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 84552 transitions. Word has length 67 [2019-12-27 05:55:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:42,454 INFO L462 AbstractCegarLoop]: Abstraction has 27631 states and 84552 transitions. [2019-12-27 05:55:42,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 05:55:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 84552 transitions. [2019-12-27 05:55:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:55:42,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:42,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:42,485 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:42,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash 108197429, now seen corresponding path program 6 times [2019-12-27 05:55:42,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:42,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019606217] [2019-12-27 05:55:42,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:42,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019606217] [2019-12-27 05:55:42,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:42,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:55:42,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007297931] [2019-12-27 05:55:42,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:55:42,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:55:42,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:55:42,896 INFO L87 Difference]: Start difference. First operand 27631 states and 84552 transitions. Second operand 16 states. [2019-12-27 05:55:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:46,917 INFO L93 Difference]: Finished difference Result 52214 states and 157793 transitions. [2019-12-27 05:55:46,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 05:55:46,918 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 05:55:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:46,989 INFO L225 Difference]: With dead ends: 52214 [2019-12-27 05:55:46,989 INFO L226 Difference]: Without dead ends: 50157 [2019-12-27 05:55:46,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=452, Invalid=2200, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 05:55:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50157 states. [2019-12-27 05:55:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50157 to 28093. [2019-12-27 05:55:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28093 states. [2019-12-27 05:55:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28093 states to 28093 states and 85777 transitions. [2019-12-27 05:55:47,566 INFO L78 Accepts]: Start accepts. Automaton has 28093 states and 85777 transitions. Word has length 67 [2019-12-27 05:55:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:47,566 INFO L462 AbstractCegarLoop]: Abstraction has 28093 states and 85777 transitions. [2019-12-27 05:55:47,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:55:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28093 states and 85777 transitions. [2019-12-27 05:55:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:55:47,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:47,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:47,594 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:47,594 INFO L82 PathProgramCache]: Analyzing trace with hash -673154253, now seen corresponding path program 7 times [2019-12-27 05:55:47,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:47,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443729111] [2019-12-27 05:55:47,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:48,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-27 05:55:48,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443729111] [2019-12-27 05:55:48,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:48,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:55:48,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569397966] [2019-12-27 05:55:48,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:55:48,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:55:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:55:48,013 INFO L87 Difference]: Start difference. First operand 28093 states and 85777 transitions. Second operand 16 states. [2019-12-27 05:55:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:52,192 INFO L93 Difference]: Finished difference Result 50456 states and 152356 transitions. [2019-12-27 05:55:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 05:55:52,193 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 05:55:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:52,267 INFO L225 Difference]: With dead ends: 50456 [2019-12-27 05:55:52,267 INFO L226 Difference]: Without dead ends: 49701 [2019-12-27 05:55:52,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=455, Invalid=2407, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 05:55:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49701 states. [2019-12-27 05:55:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49701 to 27751. [2019-12-27 05:55:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27751 states. [2019-12-27 05:55:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27751 states to 27751 states and 84879 transitions. [2019-12-27 05:55:53,071 INFO L78 Accepts]: Start accepts. Automaton has 27751 states and 84879 transitions. Word has length 67 [2019-12-27 05:55:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:53,071 INFO L462 AbstractCegarLoop]: Abstraction has 27751 states and 84879 transitions. [2019-12-27 05:55:53,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:55:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 27751 states and 84879 transitions. [2019-12-27 05:55:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:55:53,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:53,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:53,103 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:53,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:53,103 INFO L82 PathProgramCache]: Analyzing trace with hash 974475331, now seen corresponding path program 8 times [2019-12-27 05:55:53,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:53,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625675271] [2019-12-27 05:55:53,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:53,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625675271] [2019-12-27 05:55:53,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:53,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:55:53,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850048394] [2019-12-27 05:55:53,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:55:53,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:53,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:55:53,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:55:53,316 INFO L87 Difference]: Start difference. First operand 27751 states and 84879 transitions. Second operand 11 states. [2019-12-27 05:55:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:54,399 INFO L93 Difference]: Finished difference Result 45768 states and 139217 transitions. [2019-12-27 05:55:54,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:55:54,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:55:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:54,452 INFO L225 Difference]: With dead ends: 45768 [2019-12-27 05:55:54,452 INFO L226 Difference]: Without dead ends: 37505 [2019-12-27 05:55:54,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:55:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37505 states. [2019-12-27 05:55:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37505 to 22230. [2019-12-27 05:55:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22230 states. [2019-12-27 05:55:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22230 states to 22230 states and 67759 transitions. [2019-12-27 05:55:54,908 INFO L78 Accepts]: Start accepts. Automaton has 22230 states and 67759 transitions. Word has length 67 [2019-12-27 05:55:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:54,908 INFO L462 AbstractCegarLoop]: Abstraction has 22230 states and 67759 transitions. [2019-12-27 05:55:54,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:55:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 22230 states and 67759 transitions. [2019-12-27 05:55:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:55:54,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:54,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:54,931 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1670572367, now seen corresponding path program 9 times [2019-12-27 05:55:54,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:54,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071276082] [2019-12-27 05:55:54,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:55,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071276082] [2019-12-27 05:55:55,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:55,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:55:55,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096113815] [2019-12-27 05:55:55,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:55:55,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:55:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:55:55,295 INFO L87 Difference]: Start difference. First operand 22230 states and 67759 transitions. Second operand 16 states. [2019-12-27 05:56:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:00,576 INFO L93 Difference]: Finished difference Result 42713 states and 127957 transitions. [2019-12-27 05:56:00,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 05:56:00,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 05:56:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:00,632 INFO L225 Difference]: With dead ends: 42713 [2019-12-27 05:56:00,632 INFO L226 Difference]: Without dead ends: 41529 [2019-12-27 05:56:00,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=503, Invalid=2577, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 05:56:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41529 states. [2019-12-27 05:56:01,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41529 to 22234. [2019-12-27 05:56:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22234 states. [2019-12-27 05:56:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22234 states to 22234 states and 67771 transitions. [2019-12-27 05:56:01,111 INFO L78 Accepts]: Start accepts. Automaton has 22234 states and 67771 transitions. Word has length 67 [2019-12-27 05:56:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:01,111 INFO L462 AbstractCegarLoop]: Abstraction has 22234 states and 67771 transitions. [2019-12-27 05:56:01,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:56:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 22234 states and 67771 transitions. [2019-12-27 05:56:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:01,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:01,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:01,136 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash -505230993, now seen corresponding path program 10 times [2019-12-27 05:56:01,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:01,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571839727] [2019-12-27 05:56:01,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:01,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571839727] [2019-12-27 05:56:01,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:01,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 05:56:01,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519802930] [2019-12-27 05:56:01,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 05:56:01,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:01,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 05:56:01,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:56:01,689 INFO L87 Difference]: Start difference. First operand 22234 states and 67771 transitions. Second operand 17 states. [2019-12-27 05:56:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:06,686 INFO L93 Difference]: Finished difference Result 42368 states and 127104 transitions. [2019-12-27 05:56:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 05:56:06,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 05:56:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:06,744 INFO L225 Difference]: With dead ends: 42368 [2019-12-27 05:56:06,744 INFO L226 Difference]: Without dead ends: 41691 [2019-12-27 05:56:06,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=466, Invalid=2614, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 05:56:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41691 states. [2019-12-27 05:56:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41691 to 22234. [2019-12-27 05:56:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22234 states. [2019-12-27 05:56:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22234 states to 22234 states and 67767 transitions. [2019-12-27 05:56:07,384 INFO L78 Accepts]: Start accepts. Automaton has 22234 states and 67767 transitions. Word has length 67 [2019-12-27 05:56:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:07,384 INFO L462 AbstractCegarLoop]: Abstraction has 22234 states and 67767 transitions. [2019-12-27 05:56:07,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 05:56:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 22234 states and 67767 transitions. [2019-12-27 05:56:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:07,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:07,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:07,407 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1849716009, now seen corresponding path program 11 times [2019-12-27 05:56:07,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:07,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572342956] [2019-12-27 05:56:07,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:07,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572342956] [2019-12-27 05:56:07,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:07,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:56:07,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158358903] [2019-12-27 05:56:07,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:56:07,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:07,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:56:07,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:56:07,624 INFO L87 Difference]: Start difference. First operand 22234 states and 67767 transitions. Second operand 12 states. [2019-12-27 05:56:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:08,686 INFO L93 Difference]: Finished difference Result 37989 states and 115130 transitions. [2019-12-27 05:56:08,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:56:08,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 05:56:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:08,739 INFO L225 Difference]: With dead ends: 37989 [2019-12-27 05:56:08,739 INFO L226 Difference]: Without dead ends: 37065 [2019-12-27 05:56:08,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:56:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37065 states. [2019-12-27 05:56:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37065 to 21646. [2019-12-27 05:56:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21646 states. [2019-12-27 05:56:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21646 states to 21646 states and 66142 transitions. [2019-12-27 05:56:09,177 INFO L78 Accepts]: Start accepts. Automaton has 21646 states and 66142 transitions. Word has length 67 [2019-12-27 05:56:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:09,177 INFO L462 AbstractCegarLoop]: Abstraction has 21646 states and 66142 transitions. [2019-12-27 05:56:09,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:56:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 21646 states and 66142 transitions. [2019-12-27 05:56:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:09,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:09,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:09,198 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 12 times [2019-12-27 05:56:09,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:09,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163133301] [2019-12-27 05:56:09,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:56:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:56:09,334 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:56:09,335 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:56:09,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t663~0.base_21|) (= 0 v_~z$r_buff1_thd1~0_18) (= v_~x~0_10 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$w_buff1_used~0_73) (= v_~y~0_15 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t663~0.base_21|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t663~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t663~0.base_21|) |v_ULTIMATE.start_main_~#t663~0.offset_16| 0)) |v_#memory_int_19|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= |v_ULTIMATE.start_main_~#t663~0.offset_16| 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t663~0.base_21| 1)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t663~0.base_21| 4)) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t665~0.base=|v_ULTIMATE.start_main_~#t665~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t665~0.offset=|v_ULTIMATE.start_main_~#t665~0.offset_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t663~0.base=|v_ULTIMATE.start_main_~#t663~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ULTIMATE.start_main_~#t664~0.base=|v_ULTIMATE.start_main_~#t664~0.base_20|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t664~0.offset=|v_ULTIMATE.start_main_~#t664~0.offset_15|, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_~#t663~0.offset=|v_ULTIMATE.start_main_~#t663~0.offset_16|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t665~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t665~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t663~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t664~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t664~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t663~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:56:09,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:56:09,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t664~0.base_11|) (= |v_ULTIMATE.start_main_~#t664~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t664~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t664~0.base_11| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t664~0.base_11|) 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t664~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t664~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t664~0.base_11|) |v_ULTIMATE.start_main_~#t664~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t664~0.base=|v_ULTIMATE.start_main_~#t664~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t664~0.offset=|v_ULTIMATE.start_main_~#t664~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t664~0.base, #length, ULTIMATE.start_main_~#t664~0.offset] because there is no mapped edge [2019-12-27 05:56:09,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t665~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t665~0.base_12|) |v_ULTIMATE.start_main_~#t665~0.offset_10| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t665~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t665~0.offset_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t665~0.base_12| 1)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t665~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t665~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t665~0.base_12| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t665~0.base=|v_ULTIMATE.start_main_~#t665~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t665~0.offset=|v_ULTIMATE.start_main_~#t665~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t665~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t665~0.offset, #length] because there is no mapped edge [2019-12-27 05:56:09,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out1449101012| |P1Thread1of1ForFork2_#t~ite9_Out1449101012|)) (.cse0 (= (mod ~z$w_buff1_used~0_In1449101012 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1449101012 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1449101012| ~z$w_buff1~0_In1449101012) (not .cse1) .cse2) (and .cse2 (= ~z~0_In1449101012 |P1Thread1of1ForFork2_#t~ite9_Out1449101012|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1449101012, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1449101012, ~z$w_buff1~0=~z$w_buff1~0_In1449101012, ~z~0=~z~0_In1449101012} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1449101012|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1449101012, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1449101012|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1449101012, ~z$w_buff1~0=~z$w_buff1~0_In1449101012, ~z~0=~z~0_In1449101012} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:56:09,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-765520322 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out-765520322| ~z$w_buff1~0_In-765520322) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-765520322| |P2Thread1of1ForFork0_#t~ite23_Out-765520322|)) (and .cse0 (= ~z$w_buff1~0_In-765520322 |P2Thread1of1ForFork0_#t~ite23_Out-765520322|) (= |P2Thread1of1ForFork0_#t~ite24_Out-765520322| |P2Thread1of1ForFork0_#t~ite23_Out-765520322|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-765520322 256)))) (or (= (mod ~z$w_buff0_used~0_In-765520322 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-765520322 256)) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-765520322 256)))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-765520322, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-765520322, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-765520322|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-765520322, ~z$w_buff1~0=~z$w_buff1~0_In-765520322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-765520322, ~weak$$choice2~0=~weak$$choice2~0_In-765520322} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-765520322, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-765520322|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-765520322, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-765520322|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-765520322, ~z$w_buff1~0=~z$w_buff1~0_In-765520322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-765520322, ~weak$$choice2~0=~weak$$choice2~0_In-765520322} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 05:56:09,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite29_Out194702700| |P2Thread1of1ForFork0_#t~ite30_Out194702700|)) (.cse0 (= (mod ~z$w_buff0_used~0_In194702700 256) 0)) (.cse5 (= 0 (mod ~z$r_buff1_thd3~0_In194702700 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In194702700 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In194702700 256))) (.cse1 (= 0 (mod ~weak$$choice2~0_In194702700 256)))) (or (let ((.cse4 (not .cse6))) (and (not .cse0) .cse1 (= |P2Thread1of1ForFork0_#t~ite28_Out194702700| 0) .cse2 (or (not .cse3) .cse4) (or .cse4 (not .cse5)) (= |P2Thread1of1ForFork0_#t~ite29_Out194702700| |P2Thread1of1ForFork0_#t~ite28_Out194702700|))) (and (or (and .cse1 .cse2 (= ~z$w_buff1_used~0_In194702700 |P2Thread1of1ForFork0_#t~ite29_Out194702700|) (or .cse0 (and .cse6 .cse5) (and .cse6 .cse3))) (and (not .cse1) (= ~z$w_buff1_used~0_In194702700 |P2Thread1of1ForFork0_#t~ite30_Out194702700|) (= |P2Thread1of1ForFork0_#t~ite29_Out194702700| |P2Thread1of1ForFork0_#t~ite29_In194702700|))) (= |P2Thread1of1ForFork0_#t~ite28_In194702700| |P2Thread1of1ForFork0_#t~ite28_Out194702700|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In194702700|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In194702700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In194702700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194702700, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In194702700, ~weak$$choice2~0=~weak$$choice2~0_In194702700, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In194702700|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out194702700|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In194702700, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In194702700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In194702700, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In194702700, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out194702700|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out194702700|, ~weak$$choice2~0=~weak$$choice2~0_In194702700} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 05:56:09,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:56:09,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 05:56:09,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1841348725 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1841348725| |P2Thread1of1ForFork0_#t~ite39_Out1841348725|)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1841348725 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out1841348725| ~z~0_In1841348725)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1841348725| ~z$w_buff1~0_In1841348725) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1841348725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1841348725, ~z$w_buff1~0=~z$w_buff1~0_In1841348725, ~z~0=~z~0_In1841348725} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1841348725|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1841348725|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1841348725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1841348725, ~z$w_buff1~0=~z$w_buff1~0_In1841348725, ~z~0=~z~0_In1841348725} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:56:09,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1227480369 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1227480369 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1227480369 |P2Thread1of1ForFork0_#t~ite40_Out-1227480369|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1227480369|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1227480369, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1227480369} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1227480369, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1227480369|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1227480369} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:56:09,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1902414428 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1902414428 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1902414428 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1902414428 256) 0))) (or (and (= ~z$w_buff1_used~0_In1902414428 |P2Thread1of1ForFork0_#t~ite41_Out1902414428|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1902414428|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1902414428, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1902414428, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1902414428, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1902414428} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1902414428, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1902414428, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1902414428, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1902414428, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1902414428|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:56:09,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1954933443 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1954933443 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In1954933443 |P2Thread1of1ForFork0_#t~ite42_Out1954933443|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1954933443|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1954933443, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1954933443} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1954933443, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1954933443, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1954933443|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:56:09,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1547399907 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1547399907 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1547399907 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1547399907 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1547399907|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In1547399907 |P2Thread1of1ForFork0_#t~ite43_Out1547399907|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1547399907, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1547399907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1547399907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1547399907} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1547399907|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1547399907, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1547399907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1547399907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1547399907} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:56:09,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:56:09,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1856546523 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1856546523 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1856546523| ~z$w_buff0_used~0_In-1856546523) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1856546523| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1856546523, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1856546523} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1856546523|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1856546523, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1856546523} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:56:09,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1294746906 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1294746906 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1294746906 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1294746906 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1294746906 |P0Thread1of1ForFork1_#t~ite6_Out-1294746906|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1294746906|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294746906, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1294746906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1294746906, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1294746906} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1294746906, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1294746906|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1294746906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1294746906, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1294746906} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:56:09,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-753769744 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-753769744 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-753769744 ~z$r_buff0_thd1~0_Out-753769744)) (and (= 0 ~z$r_buff0_thd1~0_Out-753769744) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-753769744, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-753769744} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-753769744, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-753769744|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-753769744} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:56:09,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-629493524 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-629493524 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-629493524 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-629493524 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-629493524| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-629493524| ~z$r_buff1_thd1~0_In-629493524) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-629493524, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-629493524, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-629493524, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-629493524} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-629493524|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-629493524, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-629493524, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-629493524, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-629493524} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:56:09,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:56:09,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1001384511 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1001384511 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1001384511|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1001384511 |P1Thread1of1ForFork2_#t~ite11_Out-1001384511|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1001384511, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1001384511} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1001384511, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1001384511|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1001384511} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:56:09,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1338810711 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1338810711 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1338810711 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1338810711 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1338810711 |P1Thread1of1ForFork2_#t~ite12_Out1338810711|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1338810711|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1338810711, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1338810711, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1338810711, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1338810711} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1338810711, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1338810711, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1338810711, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1338810711|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1338810711} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:56:09,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1566723939 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1566723939 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1566723939|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1566723939 |P1Thread1of1ForFork2_#t~ite13_Out1566723939|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1566723939, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1566723939} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1566723939, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1566723939|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1566723939} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:56:09,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-577402713 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-577402713 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-577402713 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-577402713 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-577402713| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-577402713| ~z$r_buff1_thd2~0_In-577402713)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-577402713, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-577402713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-577402713, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-577402713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-577402713, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-577402713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-577402713, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-577402713|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-577402713} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:56:09,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:56:09,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:56:09,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1033101849 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1033101849 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1033101849| ~z$w_buff1~0_In-1033101849) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1033101849| ~z~0_In-1033101849)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1033101849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1033101849, ~z$w_buff1~0=~z$w_buff1~0_In-1033101849, ~z~0=~z~0_In-1033101849} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1033101849, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1033101849|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1033101849, ~z$w_buff1~0=~z$w_buff1~0_In-1033101849, ~z~0=~z~0_In-1033101849} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:56:09,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 05:56:09,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In12072301 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In12072301 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out12072301|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In12072301 |ULTIMATE.start_main_#t~ite49_Out12072301|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In12072301, ~z$w_buff0_used~0=~z$w_buff0_used~0_In12072301} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In12072301, ~z$w_buff0_used~0=~z$w_buff0_used~0_In12072301, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out12072301|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:56:09,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-256237351 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-256237351 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-256237351 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-256237351 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-256237351|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-256237351 |ULTIMATE.start_main_#t~ite50_Out-256237351|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-256237351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-256237351, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-256237351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-256237351} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-256237351|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-256237351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-256237351, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-256237351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-256237351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:56:09,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-744180384 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-744180384 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-744180384| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-744180384| ~z$r_buff0_thd0~0_In-744180384) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-744180384, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-744180384} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-744180384, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-744180384|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-744180384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:56:09,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1286970257 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1286970257 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1286970257 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1286970257 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1286970257| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-1286970257| ~z$r_buff1_thd0~0_In-1286970257) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1286970257, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1286970257, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1286970257, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1286970257} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1286970257|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1286970257, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1286970257, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1286970257, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1286970257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:56:09,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_7 2) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= 2 v_~y~0_8) (= v_~main$tmp_guard1~0_6 0) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:56:09,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:56:09 BasicIcfg [2019-12-27 05:56:09,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:56:09,473 INFO L168 Benchmark]: Toolchain (without parser) took 155767.18 ms. Allocated memory was 145.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 05:56:09,474 INFO L168 Benchmark]: CDTParser took 1.48 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 05:56:09,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.85 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 153.8 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:09,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.98 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:09,475 INFO L168 Benchmark]: Boogie Preprocessor took 37.99 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 148.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:09,475 INFO L168 Benchmark]: RCFGBuilder took 884.77 ms. Allocated memory is still 202.9 MB. Free memory was 148.9 MB in the beginning and 98.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:09,476 INFO L168 Benchmark]: TraceAbstraction took 153949.43 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 05:56:09,477 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.48 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.85 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 153.8 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.98 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.99 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 148.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 884.77 ms. Allocated memory is still 202.9 MB. Free memory was 148.9 MB in the beginning and 98.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 153949.43 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6462 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t664, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t665, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 153.5s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 68.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10639 SDtfs, 15667 SDslu, 47238 SDs, 0 SdLazy, 38780 SolverSat, 770 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 37 SyntacticMatches, 55 SemanticMatches, 673 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7062 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 51.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 388061 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1773 NumberOfCodeBlocks, 1773 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1668 ConstructedInterpolants, 0 QuantifiedInterpolants, 526107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...