/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/mix056_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:52:15,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:52:15,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:52:15,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:52:15,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:52:15,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:52:15,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:52:15,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:52:15,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:52:15,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:52:15,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:52:15,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:52:15,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:52:15,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:52:15,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:52:15,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:52:15,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:52:15,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:52:15,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:52:15,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:52:15,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:52:15,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:52:15,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:52:15,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:52:15,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:52:15,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:52:15,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:52:15,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:52:15,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:52:15,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:52:15,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:52:15,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:52:15,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:52:15,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:52:15,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:52:15,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:52:15,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:52:15,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:52:15,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:52:15,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:52:15,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:52:15,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:52:15,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:52:15,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:52:15,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:52:15,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:52:15,438 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:52:15,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:52:15,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:52:15,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:52:15,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:52:15,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:52:15,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:52:15,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:52:15,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:52:15,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:52:15,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:52:15,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:52:15,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:52:15,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:52:15,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:52:15,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:52:15,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:52:15,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:52:15,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:52:15,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:52:15,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:52:15,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:52:15,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:52:15,444 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:52:15,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:52:15,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:52:15,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:52:15,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:52:15,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:52:15,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:52:15,751 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:52:15,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-18 21:52:15,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5356d5e/050a1007c3ae499dac6b2e03029201cd/FLAGaf648257c [2019-12-18 21:52:16,347 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:52:16,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-18 21:52:16,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5356d5e/050a1007c3ae499dac6b2e03029201cd/FLAGaf648257c [2019-12-18 21:52:16,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5356d5e/050a1007c3ae499dac6b2e03029201cd [2019-12-18 21:52:16,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:52:16,650 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:52:16,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:52:16,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:52:16,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:52:16,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:52:16" (1/1) ... [2019-12-18 21:52:16,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:16, skipping insertion in model container [2019-12-18 21:52:16,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:52:16" (1/1) ... [2019-12-18 21:52:16,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:52:16,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:52:17,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:52:17,288 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:52:17,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:52:17,464 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:52:17,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17 WrapperNode [2019-12-18 21:52:17,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:52:17,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:52:17,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:52:17,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:52:17,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... [2019-12-18 21:52:17,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... [2019-12-18 21:52:17,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:52:17,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:52:17,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:52:17,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:52:17,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... [2019-12-18 21:52:17,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... [2019-12-18 21:52:17,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... [2019-12-18 21:52:17,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... [2019-12-18 21:52:17,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... [2019-12-18 21:52:17,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... [2019-12-18 21:52:17,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... [2019-12-18 21:52:17,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:52:17,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:52:17,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:52:17,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:52:17,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:52:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:52:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:52:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:52:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:52:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:52:17,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:52:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:52:17,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:52:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:52:17,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:52:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:52:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:52:17,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:52:17,672 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:52:18,473 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:52:18,473 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:52:18,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:52:18 BoogieIcfgContainer [2019-12-18 21:52:18,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:52:18,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:52:18,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:52:18,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:52:18,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:52:16" (1/3) ... [2019-12-18 21:52:18,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254dfce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:52:18, skipping insertion in model container [2019-12-18 21:52:18,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:52:17" (2/3) ... [2019-12-18 21:52:18,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254dfce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:52:18, skipping insertion in model container [2019-12-18 21:52:18,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:52:18" (3/3) ... [2019-12-18 21:52:18,484 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc.i [2019-12-18 21:52:18,495 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:52:18,496 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:52:18,504 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:52:18,505 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:52:18,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,550 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,550 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,560 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,568 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,569 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,620 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,625 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,627 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:52:18,646 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:52:18,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:52:18,668 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:52:18,668 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:52:18,668 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:52:18,668 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:52:18,668 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:52:18,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:52:18,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:52:18,688 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 21:52:18,689 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 21:52:18,777 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 21:52:18,777 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:52:18,797 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:52:18,828 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 21:52:18,874 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 21:52:18,875 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:52:18,884 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:52:18,907 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:52:18,909 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:52:22,543 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 21:52:22,677 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:52:22,717 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81192 [2019-12-18 21:52:22,717 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 21:52:22,721 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-18 21:52:41,297 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115082 states. [2019-12-18 21:52:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 115082 states. [2019-12-18 21:52:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:52:41,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:41,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:52:41,306 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash 906063, now seen corresponding path program 1 times [2019-12-18 21:52:41,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:41,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305183535] [2019-12-18 21:52:41,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:52:41,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305183535] [2019-12-18 21:52:41,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:41,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:52:41,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410426476] [2019-12-18 21:52:41,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:52:41,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:52:41,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:41,544 INFO L87 Difference]: Start difference. First operand 115082 states. Second operand 3 states. [2019-12-18 21:52:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:52:44,996 INFO L93 Difference]: Finished difference Result 113614 states and 485598 transitions. [2019-12-18 21:52:44,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:52:44,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:52:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:52:45,715 INFO L225 Difference]: With dead ends: 113614 [2019-12-18 21:52:45,716 INFO L226 Difference]: Without dead ends: 106516 [2019-12-18 21:52:45,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:52:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106516 states. [2019-12-18 21:52:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106516 to 106516. [2019-12-18 21:52:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106516 states. [2019-12-18 21:52:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106516 states to 106516 states and 454632 transitions. [2019-12-18 21:52:55,207 INFO L78 Accepts]: Start accepts. Automaton has 106516 states and 454632 transitions. Word has length 3 [2019-12-18 21:52:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:52:55,207 INFO L462 AbstractCegarLoop]: Abstraction has 106516 states and 454632 transitions. [2019-12-18 21:52:55,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:52:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 106516 states and 454632 transitions. [2019-12-18 21:52:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:52:55,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:52:55,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:52:55,212 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:52:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:52:55,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2135146020, now seen corresponding path program 1 times [2019-12-18 21:52:55,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:52:55,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983746911] [2019-12-18 21:52:55,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:52:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:52:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:52:55,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983746911] [2019-12-18 21:52:55,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:52:55,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:52:55,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175330562] [2019-12-18 21:52:55,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:52:55,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:52:55,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:52:55,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:52:55,326 INFO L87 Difference]: Start difference. First operand 106516 states and 454632 transitions. Second operand 4 states. [2019-12-18 21:53:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:00,764 INFO L93 Difference]: Finished difference Result 168744 states and 686980 transitions. [2019-12-18 21:53:00,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:53:00,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:53:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:01,381 INFO L225 Difference]: With dead ends: 168744 [2019-12-18 21:53:01,382 INFO L226 Difference]: Without dead ends: 168695 [2019-12-18 21:53:01,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168695 states. [2019-12-18 21:53:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168695 to 154366. [2019-12-18 21:53:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154366 states. [2019-12-18 21:53:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154366 states to 154366 states and 637272 transitions. [2019-12-18 21:53:15,926 INFO L78 Accepts]: Start accepts. Automaton has 154366 states and 637272 transitions. Word has length 11 [2019-12-18 21:53:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:15,926 INFO L462 AbstractCegarLoop]: Abstraction has 154366 states and 637272 transitions. [2019-12-18 21:53:15,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:53:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 154366 states and 637272 transitions. [2019-12-18 21:53:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:53:15,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:15,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:15,932 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:15,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:15,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1594443795, now seen corresponding path program 1 times [2019-12-18 21:53:15,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:15,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423922940] [2019-12-18 21:53:15,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:16,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423922940] [2019-12-18 21:53:16,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:16,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:16,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552066161] [2019-12-18 21:53:16,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:16,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:16,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:16,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:16,011 INFO L87 Difference]: Start difference. First operand 154366 states and 637272 transitions. Second operand 3 states. [2019-12-18 21:53:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:16,151 INFO L93 Difference]: Finished difference Result 33669 states and 109308 transitions. [2019-12-18 21:53:16,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:16,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:53:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:16,253 INFO L225 Difference]: With dead ends: 33669 [2019-12-18 21:53:16,254 INFO L226 Difference]: Without dead ends: 33669 [2019-12-18 21:53:16,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33669 states. [2019-12-18 21:53:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33669 to 33669. [2019-12-18 21:53:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33669 states. [2019-12-18 21:53:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33669 states to 33669 states and 109308 transitions. [2019-12-18 21:53:16,993 INFO L78 Accepts]: Start accepts. Automaton has 33669 states and 109308 transitions. Word has length 13 [2019-12-18 21:53:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:16,993 INFO L462 AbstractCegarLoop]: Abstraction has 33669 states and 109308 transitions. [2019-12-18 21:53:16,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 33669 states and 109308 transitions. [2019-12-18 21:53:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:53:16,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:16,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:16,996 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1527563672, now seen corresponding path program 1 times [2019-12-18 21:53:16,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:16,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500209188] [2019-12-18 21:53:16,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:17,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500209188] [2019-12-18 21:53:17,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:17,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:53:17,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592968021] [2019-12-18 21:53:17,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:17,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:17,067 INFO L87 Difference]: Start difference. First operand 33669 states and 109308 transitions. Second operand 3 states. [2019-12-18 21:53:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:17,299 INFO L93 Difference]: Finished difference Result 50580 states and 164138 transitions. [2019-12-18 21:53:17,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:17,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:53:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:17,407 INFO L225 Difference]: With dead ends: 50580 [2019-12-18 21:53:17,407 INFO L226 Difference]: Without dead ends: 50580 [2019-12-18 21:53:17,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50580 states. [2019-12-18 21:53:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50580 to 36729. [2019-12-18 21:53:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36729 states. [2019-12-18 21:53:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36729 states to 36729 states and 120582 transitions. [2019-12-18 21:53:19,595 INFO L78 Accepts]: Start accepts. Automaton has 36729 states and 120582 transitions. Word has length 16 [2019-12-18 21:53:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:19,596 INFO L462 AbstractCegarLoop]: Abstraction has 36729 states and 120582 transitions. [2019-12-18 21:53:19,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 36729 states and 120582 transitions. [2019-12-18 21:53:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:53:19,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:19,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:19,600 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:19,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1527444198, now seen corresponding path program 1 times [2019-12-18 21:53:19,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:19,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697523100] [2019-12-18 21:53:19,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:19,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697523100] [2019-12-18 21:53:19,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:19,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:19,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193653509] [2019-12-18 21:53:19,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:53:19,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:19,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:53:19,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:53:19,693 INFO L87 Difference]: Start difference. First operand 36729 states and 120582 transitions. Second operand 4 states. [2019-12-18 21:53:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:20,075 INFO L93 Difference]: Finished difference Result 43883 states and 141848 transitions. [2019-12-18 21:53:20,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:53:20,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:53:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:20,148 INFO L225 Difference]: With dead ends: 43883 [2019-12-18 21:53:20,148 INFO L226 Difference]: Without dead ends: 43883 [2019-12-18 21:53:20,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43883 states. [2019-12-18 21:53:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43883 to 40260. [2019-12-18 21:53:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40260 states. [2019-12-18 21:53:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40260 states to 40260 states and 131124 transitions. [2019-12-18 21:53:20,865 INFO L78 Accepts]: Start accepts. Automaton has 40260 states and 131124 transitions. Word has length 16 [2019-12-18 21:53:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:20,865 INFO L462 AbstractCegarLoop]: Abstraction has 40260 states and 131124 transitions. [2019-12-18 21:53:20,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:53:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 40260 states and 131124 transitions. [2019-12-18 21:53:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:53:20,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:20,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:20,868 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1609012266, now seen corresponding path program 1 times [2019-12-18 21:53:20,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:20,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332806934] [2019-12-18 21:53:20,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:20,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332806934] [2019-12-18 21:53:20,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:20,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:20,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344500603] [2019-12-18 21:53:20,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:53:20,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:20,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:53:20,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:53:20,932 INFO L87 Difference]: Start difference. First operand 40260 states and 131124 transitions. Second operand 4 states. [2019-12-18 21:53:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:22,012 INFO L93 Difference]: Finished difference Result 47608 states and 154005 transitions. [2019-12-18 21:53:22,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:53:22,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:53:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:22,088 INFO L225 Difference]: With dead ends: 47608 [2019-12-18 21:53:22,088 INFO L226 Difference]: Without dead ends: 47608 [2019-12-18 21:53:22,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47608 states. [2019-12-18 21:53:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47608 to 40827. [2019-12-18 21:53:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40827 states. [2019-12-18 21:53:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40827 states to 40827 states and 133422 transitions. [2019-12-18 21:53:22,799 INFO L78 Accepts]: Start accepts. Automaton has 40827 states and 133422 transitions. Word has length 16 [2019-12-18 21:53:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:22,799 INFO L462 AbstractCegarLoop]: Abstraction has 40827 states and 133422 transitions. [2019-12-18 21:53:22,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:53:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 40827 states and 133422 transitions. [2019-12-18 21:53:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:53:22,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:22,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:22,810 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:22,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1226017601, now seen corresponding path program 1 times [2019-12-18 21:53:22,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:22,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622105321] [2019-12-18 21:53:22,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:22,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622105321] [2019-12-18 21:53:22,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:22,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:53:22,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680610539] [2019-12-18 21:53:22,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:22,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:22,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:22,904 INFO L87 Difference]: Start difference. First operand 40827 states and 133422 transitions. Second operand 5 states. [2019-12-18 21:53:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:23,572 INFO L93 Difference]: Finished difference Result 57178 states and 181649 transitions. [2019-12-18 21:53:23,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:53:23,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 21:53:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:23,665 INFO L225 Difference]: With dead ends: 57178 [2019-12-18 21:53:23,665 INFO L226 Difference]: Without dead ends: 57171 [2019-12-18 21:53:23,665 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-18 21:53:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57171 states. [2019-12-18 21:53:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57171 to 42171. [2019-12-18 21:53:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42171 states. [2019-12-18 21:53:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42171 states to 42171 states and 137482 transitions. [2019-12-18 21:53:26,759 INFO L78 Accepts]: Start accepts. Automaton has 42171 states and 137482 transitions. Word has length 22 [2019-12-18 21:53:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:26,759 INFO L462 AbstractCegarLoop]: Abstraction has 42171 states and 137482 transitions. [2019-12-18 21:53:26,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 42171 states and 137482 transitions. [2019-12-18 21:53:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:53:26,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:26,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:26,769 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1893580273, now seen corresponding path program 1 times [2019-12-18 21:53:26,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:26,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752000479] [2019-12-18 21:53:26,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:26,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752000479] [2019-12-18 21:53:26,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:26,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:53:26,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610724017] [2019-12-18 21:53:26,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:26,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:26,842 INFO L87 Difference]: Start difference. First operand 42171 states and 137482 transitions. Second operand 5 states. [2019-12-18 21:53:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:27,613 INFO L93 Difference]: Finished difference Result 59763 states and 189217 transitions. [2019-12-18 21:53:27,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:53:27,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 21:53:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:27,776 INFO L225 Difference]: With dead ends: 59763 [2019-12-18 21:53:27,776 INFO L226 Difference]: Without dead ends: 59756 [2019-12-18 21:53:27,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-18 21:53:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59756 states. [2019-12-18 21:53:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59756 to 40228. [2019-12-18 21:53:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40228 states. [2019-12-18 21:53:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40228 states to 40228 states and 131220 transitions. [2019-12-18 21:53:28,730 INFO L78 Accepts]: Start accepts. Automaton has 40228 states and 131220 transitions. Word has length 22 [2019-12-18 21:53:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:28,730 INFO L462 AbstractCegarLoop]: Abstraction has 40228 states and 131220 transitions. [2019-12-18 21:53:28,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 40228 states and 131220 transitions. [2019-12-18 21:53:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:53:28,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:28,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] [2019-12-18 21:53:28,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:28,742 INFO L82 PathProgramCache]: Analyzing trace with hash -386787907, now seen corresponding path program 1 times [2019-12-18 21:53:28,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:28,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688131751] [2019-12-18 21:53:28,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:28,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688131751] [2019-12-18 21:53:28,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:28,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:53:28,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926324991] [2019-12-18 21:53:28,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:53:28,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:53:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:53:28,788 INFO L87 Difference]: Start difference. First operand 40228 states and 131220 transitions. Second operand 4 states. [2019-12-18 21:53:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:28,865 INFO L93 Difference]: Finished difference Result 15958 states and 49114 transitions. [2019-12-18 21:53:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:53:28,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:53:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:28,887 INFO L225 Difference]: With dead ends: 15958 [2019-12-18 21:53:28,888 INFO L226 Difference]: Without dead ends: 15958 [2019-12-18 21:53:28,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:53:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15958 states. [2019-12-18 21:53:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15958 to 15686. [2019-12-18 21:53:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-18 21:53:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 48338 transitions. [2019-12-18 21:53:29,520 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 48338 transitions. Word has length 25 [2019-12-18 21:53:29,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:29,520 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 48338 transitions. [2019-12-18 21:53:29,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:53:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 48338 transitions. [2019-12-18 21:53:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:53:29,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:29,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:29,533 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2128582184, now seen corresponding path program 1 times [2019-12-18 21:53:29,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:29,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269666349] [2019-12-18 21:53:29,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:29,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269666349] [2019-12-18 21:53:29,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:29,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:53:29,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93253301] [2019-12-18 21:53:29,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:29,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:29,603 INFO L87 Difference]: Start difference. First operand 15686 states and 48338 transitions. Second operand 5 states. [2019-12-18 21:53:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:29,994 INFO L93 Difference]: Finished difference Result 20194 states and 61068 transitions. [2019-12-18 21:53:29,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:53:29,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:53:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:30,023 INFO L225 Difference]: With dead ends: 20194 [2019-12-18 21:53:30,023 INFO L226 Difference]: Without dead ends: 20194 [2019-12-18 21:53:30,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:53:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20194 states. [2019-12-18 21:53:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20194 to 18928. [2019-12-18 21:53:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18928 states. [2019-12-18 21:53:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18928 states to 18928 states and 57898 transitions. [2019-12-18 21:53:30,317 INFO L78 Accepts]: Start accepts. Automaton has 18928 states and 57898 transitions. Word has length 27 [2019-12-18 21:53:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:30,318 INFO L462 AbstractCegarLoop]: Abstraction has 18928 states and 57898 transitions. [2019-12-18 21:53:30,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 18928 states and 57898 transitions. [2019-12-18 21:53:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:53:30,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:30,331 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-18 21:53:30,331 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -786933729, now seen corresponding path program 1 times [2019-12-18 21:53:30,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:30,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053084215] [2019-12-18 21:53:30,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:30,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053084215] [2019-12-18 21:53:30,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:30,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:53:30,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849971204] [2019-12-18 21:53:30,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:30,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:30,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:30,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:30,404 INFO L87 Difference]: Start difference. First operand 18928 states and 57898 transitions. Second operand 5 states. [2019-12-18 21:53:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:30,773 INFO L93 Difference]: Finished difference Result 21983 states and 66241 transitions. [2019-12-18 21:53:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:53:30,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 21:53:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:30,804 INFO L225 Difference]: With dead ends: 21983 [2019-12-18 21:53:30,804 INFO L226 Difference]: Without dead ends: 21983 [2019-12-18 21:53:30,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:53:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21983 states. [2019-12-18 21:53:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21983 to 17922. [2019-12-18 21:53:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2019-12-18 21:53:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 54947 transitions. [2019-12-18 21:53:31,100 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 54947 transitions. Word has length 28 [2019-12-18 21:53:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:31,100 INFO L462 AbstractCegarLoop]: Abstraction has 17922 states and 54947 transitions. [2019-12-18 21:53:31,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 54947 transitions. [2019-12-18 21:53:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:53:31,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:31,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:31,121 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash 960669183, now seen corresponding path program 1 times [2019-12-18 21:53:31,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:31,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371549267] [2019-12-18 21:53:31,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:31,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371549267] [2019-12-18 21:53:31,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:31,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:53:31,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941450446] [2019-12-18 21:53:31,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:53:31,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:31,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:53:31,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:53:31,205 INFO L87 Difference]: Start difference. First operand 17922 states and 54947 transitions. Second operand 6 states. [2019-12-18 21:53:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:31,973 INFO L93 Difference]: Finished difference Result 25328 states and 75654 transitions. [2019-12-18 21:53:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:53:31,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 21:53:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:32,012 INFO L225 Difference]: With dead ends: 25328 [2019-12-18 21:53:32,012 INFO L226 Difference]: Without dead ends: 25328 [2019-12-18 21:53:32,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:53:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25328 states. [2019-12-18 21:53:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25328 to 19485. [2019-12-18 21:53:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19485 states. [2019-12-18 21:53:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 59441 transitions. [2019-12-18 21:53:32,707 INFO L78 Accepts]: Start accepts. Automaton has 19485 states and 59441 transitions. Word has length 33 [2019-12-18 21:53:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:32,707 INFO L462 AbstractCegarLoop]: Abstraction has 19485 states and 59441 transitions. [2019-12-18 21:53:32,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:53:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 19485 states and 59441 transitions. [2019-12-18 21:53:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:53:32,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:32,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:32,730 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:32,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash 446722116, now seen corresponding path program 1 times [2019-12-18 21:53:32,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:32,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249465766] [2019-12-18 21:53:32,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:32,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:32,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249465766] [2019-12-18 21:53:32,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:32,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:53:32,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57766357] [2019-12-18 21:53:32,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:53:32,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:32,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:53:32,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:53:32,818 INFO L87 Difference]: Start difference. First operand 19485 states and 59441 transitions. Second operand 6 states. [2019-12-18 21:53:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:33,514 INFO L93 Difference]: Finished difference Result 24785 states and 74278 transitions. [2019-12-18 21:53:33,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:53:33,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 21:53:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:33,549 INFO L225 Difference]: With dead ends: 24785 [2019-12-18 21:53:33,550 INFO L226 Difference]: Without dead ends: 24785 [2019-12-18 21:53:33,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:53:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24785 states. [2019-12-18 21:53:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24785 to 16236. [2019-12-18 21:53:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16236 states. [2019-12-18 21:53:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16236 states to 16236 states and 49996 transitions. [2019-12-18 21:53:33,842 INFO L78 Accepts]: Start accepts. Automaton has 16236 states and 49996 transitions. Word has length 34 [2019-12-18 21:53:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:33,842 INFO L462 AbstractCegarLoop]: Abstraction has 16236 states and 49996 transitions. [2019-12-18 21:53:33,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:53:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16236 states and 49996 transitions. [2019-12-18 21:53:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:53:33,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:33,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:33,863 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:33,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2087465042, now seen corresponding path program 1 times [2019-12-18 21:53:33,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:33,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16959104] [2019-12-18 21:53:33,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:33,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16959104] [2019-12-18 21:53:33,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:33,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:33,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52446424] [2019-12-18 21:53:33,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:33,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:33,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:33,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:33,923 INFO L87 Difference]: Start difference. First operand 16236 states and 49996 transitions. Second operand 3 states. [2019-12-18 21:53:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:34,046 INFO L93 Difference]: Finished difference Result 30656 states and 94507 transitions. [2019-12-18 21:53:34,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:34,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 21:53:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:34,077 INFO L225 Difference]: With dead ends: 30656 [2019-12-18 21:53:34,077 INFO L226 Difference]: Without dead ends: 16674 [2019-12-18 21:53:34,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16674 states. [2019-12-18 21:53:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16674 to 16618. [2019-12-18 21:53:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16618 states. [2019-12-18 21:53:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16618 states to 16618 states and 49905 transitions. [2019-12-18 21:53:34,324 INFO L78 Accepts]: Start accepts. Automaton has 16618 states and 49905 transitions. Word has length 39 [2019-12-18 21:53:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:34,324 INFO L462 AbstractCegarLoop]: Abstraction has 16618 states and 49905 transitions. [2019-12-18 21:53:34,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 16618 states and 49905 transitions. [2019-12-18 21:53:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:53:34,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:34,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:34,342 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:34,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1869969437, now seen corresponding path program 1 times [2019-12-18 21:53:34,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:34,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047956896] [2019-12-18 21:53:34,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:34,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047956896] [2019-12-18 21:53:34,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:34,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:53:34,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482867942] [2019-12-18 21:53:34,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:34,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:34,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:34,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:34,423 INFO L87 Difference]: Start difference. First operand 16618 states and 49905 transitions. Second operand 5 states. [2019-12-18 21:53:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:35,141 INFO L93 Difference]: Finished difference Result 24481 states and 72787 transitions. [2019-12-18 21:53:35,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:53:35,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:53:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:35,186 INFO L225 Difference]: With dead ends: 24481 [2019-12-18 21:53:35,186 INFO L226 Difference]: Without dead ends: 24481 [2019-12-18 21:53:35,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:53:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24481 states. [2019-12-18 21:53:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24481 to 22590. [2019-12-18 21:53:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22590 states. [2019-12-18 21:53:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22590 states to 22590 states and 67706 transitions. [2019-12-18 21:53:35,538 INFO L78 Accepts]: Start accepts. Automaton has 22590 states and 67706 transitions. Word has length 40 [2019-12-18 21:53:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:35,539 INFO L462 AbstractCegarLoop]: Abstraction has 22590 states and 67706 transitions. [2019-12-18 21:53:35,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 22590 states and 67706 transitions. [2019-12-18 21:53:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:53:35,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:35,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:35,565 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:35,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:35,565 INFO L82 PathProgramCache]: Analyzing trace with hash 511931149, now seen corresponding path program 2 times [2019-12-18 21:53:35,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:35,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485531306] [2019-12-18 21:53:35,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:35,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485531306] [2019-12-18 21:53:35,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:35,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:53:35,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588798144] [2019-12-18 21:53:35,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:35,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:35,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:35,627 INFO L87 Difference]: Start difference. First operand 22590 states and 67706 transitions. Second operand 5 states. [2019-12-18 21:53:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:35,723 INFO L93 Difference]: Finished difference Result 21296 states and 64675 transitions. [2019-12-18 21:53:35,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:53:35,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 21:53:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:35,750 INFO L225 Difference]: With dead ends: 21296 [2019-12-18 21:53:35,750 INFO L226 Difference]: Without dead ends: 19695 [2019-12-18 21:53:35,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19695 states. [2019-12-18 21:53:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19695 to 18820. [2019-12-18 21:53:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18820 states. [2019-12-18 21:53:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18820 states to 18820 states and 58791 transitions. [2019-12-18 21:53:36,329 INFO L78 Accepts]: Start accepts. Automaton has 18820 states and 58791 transitions. Word has length 40 [2019-12-18 21:53:36,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:36,330 INFO L462 AbstractCegarLoop]: Abstraction has 18820 states and 58791 transitions. [2019-12-18 21:53:36,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 18820 states and 58791 transitions. [2019-12-18 21:53:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:53:36,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:36,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:36,358 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash -396532309, now seen corresponding path program 1 times [2019-12-18 21:53:36,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:36,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624043791] [2019-12-18 21:53:36,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:36,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624043791] [2019-12-18 21:53:36,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:36,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:53:36,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200432052] [2019-12-18 21:53:36,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:53:36,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:53:36,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:53:36,472 INFO L87 Difference]: Start difference. First operand 18820 states and 58791 transitions. Second operand 8 states. [2019-12-18 21:53:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:37,803 INFO L93 Difference]: Finished difference Result 83037 states and 255738 transitions. [2019-12-18 21:53:37,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:53:37,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 21:53:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:37,896 INFO L225 Difference]: With dead ends: 83037 [2019-12-18 21:53:37,896 INFO L226 Difference]: Without dead ends: 60950 [2019-12-18 21:53:37,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:53:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60950 states. [2019-12-18 21:53:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60950 to 21754. [2019-12-18 21:53:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21754 states. [2019-12-18 21:53:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21754 states to 21754 states and 68550 transitions. [2019-12-18 21:53:38,519 INFO L78 Accepts]: Start accepts. Automaton has 21754 states and 68550 transitions. Word has length 64 [2019-12-18 21:53:38,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:38,520 INFO L462 AbstractCegarLoop]: Abstraction has 21754 states and 68550 transitions. [2019-12-18 21:53:38,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:53:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21754 states and 68550 transitions. [2019-12-18 21:53:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:53:38,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:38,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:38,544 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:38,545 INFO L82 PathProgramCache]: Analyzing trace with hash 207783117, now seen corresponding path program 2 times [2019-12-18 21:53:38,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:38,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119521888] [2019-12-18 21:53:38,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:38,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119521888] [2019-12-18 21:53:38,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:38,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:53:38,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591633339] [2019-12-18 21:53:38,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:53:38,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:38,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:53:38,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:53:38,645 INFO L87 Difference]: Start difference. First operand 21754 states and 68550 transitions. Second operand 7 states. [2019-12-18 21:53:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:39,154 INFO L93 Difference]: Finished difference Result 63090 states and 195449 transitions. [2019-12-18 21:53:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:53:39,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:53:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:39,226 INFO L225 Difference]: With dead ends: 63090 [2019-12-18 21:53:39,226 INFO L226 Difference]: Without dead ends: 43700 [2019-12-18 21:53:39,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:53:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43700 states. [2019-12-18 21:53:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43700 to 25248. [2019-12-18 21:53:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25248 states. [2019-12-18 21:53:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25248 states to 25248 states and 79446 transitions. [2019-12-18 21:53:40,097 INFO L78 Accepts]: Start accepts. Automaton has 25248 states and 79446 transitions. Word has length 64 [2019-12-18 21:53:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:40,097 INFO L462 AbstractCegarLoop]: Abstraction has 25248 states and 79446 transitions. [2019-12-18 21:53:40,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:53:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 25248 states and 79446 transitions. [2019-12-18 21:53:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:53:40,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:40,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] [2019-12-18 21:53:40,136 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash -771277719, now seen corresponding path program 3 times [2019-12-18 21:53:40,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:40,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877494755] [2019-12-18 21:53:40,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:40,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877494755] [2019-12-18 21:53:40,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:40,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:53:40,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269144480] [2019-12-18 21:53:40,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:53:40,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:40,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:53:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:53:40,239 INFO L87 Difference]: Start difference. First operand 25248 states and 79446 transitions. Second operand 9 states. [2019-12-18 21:53:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:41,789 INFO L93 Difference]: Finished difference Result 97649 states and 297801 transitions. [2019-12-18 21:53:41,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 21:53:41,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 21:53:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:41,919 INFO L225 Difference]: With dead ends: 97649 [2019-12-18 21:53:41,920 INFO L226 Difference]: Without dead ends: 85088 [2019-12-18 21:53:41,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-18 21:53:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85088 states. [2019-12-18 21:53:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85088 to 25278. [2019-12-18 21:53:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25278 states. [2019-12-18 21:53:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25278 states to 25278 states and 79574 transitions. [2019-12-18 21:53:42,755 INFO L78 Accepts]: Start accepts. Automaton has 25278 states and 79574 transitions. Word has length 64 [2019-12-18 21:53:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:42,755 INFO L462 AbstractCegarLoop]: Abstraction has 25278 states and 79574 transitions. [2019-12-18 21:53:42,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:53:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 25278 states and 79574 transitions. [2019-12-18 21:53:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:53:42,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:42,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:42,784 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:42,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1906378155, now seen corresponding path program 4 times [2019-12-18 21:53:42,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:42,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644765812] [2019-12-18 21:53:42,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:42,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644765812] [2019-12-18 21:53:42,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:42,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:53:42,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097870229] [2019-12-18 21:53:42,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:53:42,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:42,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:53:42,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:53:42,905 INFO L87 Difference]: Start difference. First operand 25278 states and 79574 transitions. Second operand 9 states. [2019-12-18 21:53:43,426 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-18 21:53:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:44,712 INFO L93 Difference]: Finished difference Result 114325 states and 348784 transitions. [2019-12-18 21:53:44,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 21:53:44,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 21:53:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:44,879 INFO L225 Difference]: With dead ends: 114325 [2019-12-18 21:53:44,879 INFO L226 Difference]: Without dead ends: 106341 [2019-12-18 21:53:44,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-18 21:53:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106341 states. [2019-12-18 21:53:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106341 to 25315. [2019-12-18 21:53:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25315 states. [2019-12-18 21:53:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25315 states to 25315 states and 79778 transitions. [2019-12-18 21:53:45,859 INFO L78 Accepts]: Start accepts. Automaton has 25315 states and 79778 transitions. Word has length 64 [2019-12-18 21:53:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:45,859 INFO L462 AbstractCegarLoop]: Abstraction has 25315 states and 79778 transitions. [2019-12-18 21:53:45,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:53:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 25315 states and 79778 transitions. [2019-12-18 21:53:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:53:45,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:45,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:45,889 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1182182323, now seen corresponding path program 5 times [2019-12-18 21:53:45,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:45,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176250504] [2019-12-18 21:53:45,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:45,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176250504] [2019-12-18 21:53:45,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:45,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:53:45,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11281131] [2019-12-18 21:53:45,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:53:45,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:45,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:53:45,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:53:45,978 INFO L87 Difference]: Start difference. First operand 25315 states and 79778 transitions. Second operand 7 states. [2019-12-18 21:53:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:46,607 INFO L93 Difference]: Finished difference Result 54114 states and 167811 transitions. [2019-12-18 21:53:46,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:53:46,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:53:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:46,725 INFO L225 Difference]: With dead ends: 54114 [2019-12-18 21:53:46,725 INFO L226 Difference]: Without dead ends: 47169 [2019-12-18 21:53:46,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:53:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47169 states. [2019-12-18 21:53:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47169 to 25623. [2019-12-18 21:53:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25623 states. [2019-12-18 21:53:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25623 states to 25623 states and 80729 transitions. [2019-12-18 21:53:47,707 INFO L78 Accepts]: Start accepts. Automaton has 25623 states and 80729 transitions. Word has length 64 [2019-12-18 21:53:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:47,708 INFO L462 AbstractCegarLoop]: Abstraction has 25623 states and 80729 transitions. [2019-12-18 21:53:47,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:53:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 25623 states and 80729 transitions. [2019-12-18 21:53:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:53:47,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:47,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:47,738 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:47,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:47,738 INFO L82 PathProgramCache]: Analyzing trace with hash -503301939, now seen corresponding path program 6 times [2019-12-18 21:53:47,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:47,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568214713] [2019-12-18 21:53:47,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:47,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568214713] [2019-12-18 21:53:47,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:47,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:47,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715102041] [2019-12-18 21:53:47,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:47,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:47,811 INFO L87 Difference]: Start difference. First operand 25623 states and 80729 transitions. Second operand 3 states. [2019-12-18 21:53:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:47,977 INFO L93 Difference]: Finished difference Result 32590 states and 101569 transitions. [2019-12-18 21:53:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:47,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 21:53:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:48,025 INFO L225 Difference]: With dead ends: 32590 [2019-12-18 21:53:48,025 INFO L226 Difference]: Without dead ends: 32590 [2019-12-18 21:53:48,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32590 states. [2019-12-18 21:53:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32590 to 28272. [2019-12-18 21:53:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28272 states. [2019-12-18 21:53:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28272 states to 28272 states and 89027 transitions. [2019-12-18 21:53:48,504 INFO L78 Accepts]: Start accepts. Automaton has 28272 states and 89027 transitions. Word has length 64 [2019-12-18 21:53:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:48,504 INFO L462 AbstractCegarLoop]: Abstraction has 28272 states and 89027 transitions. [2019-12-18 21:53:48,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28272 states and 89027 transitions. [2019-12-18 21:53:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:53:48,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:48,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:48,538 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash -862043868, now seen corresponding path program 1 times [2019-12-18 21:53:48,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:48,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357969322] [2019-12-18 21:53:48,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:48,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357969322] [2019-12-18 21:53:48,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:48,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:53:48,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672441861] [2019-12-18 21:53:48,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:48,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:48,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:48,599 INFO L87 Difference]: Start difference. First operand 28272 states and 89027 transitions. Second operand 5 states. [2019-12-18 21:53:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:48,921 INFO L93 Difference]: Finished difference Result 40291 states and 124398 transitions. [2019-12-18 21:53:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:53:48,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 21:53:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:48,979 INFO L225 Difference]: With dead ends: 40291 [2019-12-18 21:53:48,979 INFO L226 Difference]: Without dead ends: 40291 [2019-12-18 21:53:48,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:53:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40291 states. [2019-12-18 21:53:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40291 to 28764. [2019-12-18 21:53:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28764 states. [2019-12-18 21:53:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28764 states to 28764 states and 90626 transitions. [2019-12-18 21:53:49,524 INFO L78 Accepts]: Start accepts. Automaton has 28764 states and 90626 transitions. Word has length 65 [2019-12-18 21:53:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:49,524 INFO L462 AbstractCegarLoop]: Abstraction has 28764 states and 90626 transitions. [2019-12-18 21:53:49,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28764 states and 90626 transitions. [2019-12-18 21:53:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:53:49,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:49,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:49,554 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1255708014, now seen corresponding path program 2 times [2019-12-18 21:53:49,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:49,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290808099] [2019-12-18 21:53:49,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:49,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290808099] [2019-12-18 21:53:49,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:49,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:53:49,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68043012] [2019-12-18 21:53:49,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:49,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:49,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:49,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:49,607 INFO L87 Difference]: Start difference. First operand 28764 states and 90626 transitions. Second operand 5 states. [2019-12-18 21:53:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:49,994 INFO L93 Difference]: Finished difference Result 48318 states and 149863 transitions. [2019-12-18 21:53:49,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:53:49,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 21:53:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:50,439 INFO L225 Difference]: With dead ends: 48318 [2019-12-18 21:53:50,439 INFO L226 Difference]: Without dead ends: 48318 [2019-12-18 21:53:50,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:53:50,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48318 states. [2019-12-18 21:53:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48318 to 30456. [2019-12-18 21:53:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30456 states. [2019-12-18 21:53:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30456 states to 30456 states and 96572 transitions. [2019-12-18 21:53:51,040 INFO L78 Accepts]: Start accepts. Automaton has 30456 states and 96572 transitions. Word has length 65 [2019-12-18 21:53:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:51,040 INFO L462 AbstractCegarLoop]: Abstraction has 30456 states and 96572 transitions. [2019-12-18 21:53:51,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 30456 states and 96572 transitions. [2019-12-18 21:53:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:53:51,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:51,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:51,077 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1852156654, now seen corresponding path program 3 times [2019-12-18 21:53:51,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:51,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616398717] [2019-12-18 21:53:51,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:51,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616398717] [2019-12-18 21:53:51,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:51,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:53:51,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651546748] [2019-12-18 21:53:51,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:53:51,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:53:51,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:53:51,171 INFO L87 Difference]: Start difference. First operand 30456 states and 96572 transitions. Second operand 8 states. [2019-12-18 21:53:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:52,370 INFO L93 Difference]: Finished difference Result 101087 states and 312150 transitions. [2019-12-18 21:53:52,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:53:52,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 21:53:52,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:52,515 INFO L225 Difference]: With dead ends: 101087 [2019-12-18 21:53:52,515 INFO L226 Difference]: Without dead ends: 89723 [2019-12-18 21:53:52,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:53:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89723 states. [2019-12-18 21:53:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89723 to 30423. [2019-12-18 21:53:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30423 states. [2019-12-18 21:53:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30423 states to 30423 states and 96435 transitions. [2019-12-18 21:53:53,435 INFO L78 Accepts]: Start accepts. Automaton has 30423 states and 96435 transitions. Word has length 65 [2019-12-18 21:53:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:53,435 INFO L462 AbstractCegarLoop]: Abstraction has 30423 states and 96435 transitions. [2019-12-18 21:53:53,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:53:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 30423 states and 96435 transitions. [2019-12-18 21:53:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:53:53,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:53,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:53,470 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:53,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:53,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1743149806, now seen corresponding path program 4 times [2019-12-18 21:53:53,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:53,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098480989] [2019-12-18 21:53:53,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:54,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098480989] [2019-12-18 21:53:54,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:54,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:53:54,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397540838] [2019-12-18 21:53:54,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:53:54,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:54,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:53:54,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:53:54,029 INFO L87 Difference]: Start difference. First operand 30423 states and 96435 transitions. Second operand 9 states. [2019-12-18 21:53:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:55,675 INFO L93 Difference]: Finished difference Result 129828 states and 399546 transitions. [2019-12-18 21:53:55,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 21:53:55,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 21:53:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:55,860 INFO L225 Difference]: With dead ends: 129828 [2019-12-18 21:53:55,860 INFO L226 Difference]: Without dead ends: 115403 [2019-12-18 21:53:55,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 21:53:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115403 states. [2019-12-18 21:53:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115403 to 31034. [2019-12-18 21:53:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31034 states. [2019-12-18 21:53:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31034 states to 31034 states and 98386 transitions. [2019-12-18 21:53:56,995 INFO L78 Accepts]: Start accepts. Automaton has 31034 states and 98386 transitions. Word has length 65 [2019-12-18 21:53:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:56,995 INFO L462 AbstractCegarLoop]: Abstraction has 31034 states and 98386 transitions. [2019-12-18 21:53:56,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:53:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31034 states and 98386 transitions. [2019-12-18 21:53:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:53:57,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:57,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:57,030 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1309362670, now seen corresponding path program 5 times [2019-12-18 21:53:57,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:57,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793249284] [2019-12-18 21:53:57,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:57,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793249284] [2019-12-18 21:53:57,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:57,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:53:57,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583241953] [2019-12-18 21:53:57,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:53:57,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:57,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:53:57,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:53:57,155 INFO L87 Difference]: Start difference. First operand 31034 states and 98386 transitions. Second operand 9 states. [2019-12-18 21:53:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:59,546 INFO L93 Difference]: Finished difference Result 150516 states and 464409 transitions. [2019-12-18 21:53:59,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 21:53:59,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 21:53:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:59,734 INFO L225 Difference]: With dead ends: 150516 [2019-12-18 21:53:59,734 INFO L226 Difference]: Without dead ends: 121037 [2019-12-18 21:53:59,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-18 21:54:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121037 states. [2019-12-18 21:54:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121037 to 34422. [2019-12-18 21:54:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34422 states. [2019-12-18 21:54:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34422 states to 34422 states and 109173 transitions. [2019-12-18 21:54:00,932 INFO L78 Accepts]: Start accepts. Automaton has 34422 states and 109173 transitions. Word has length 65 [2019-12-18 21:54:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:00,933 INFO L462 AbstractCegarLoop]: Abstraction has 34422 states and 109173 transitions. [2019-12-18 21:54:00,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:54:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 34422 states and 109173 transitions. [2019-12-18 21:54:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:54:00,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:00,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:00,971 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:00,972 INFO L82 PathProgramCache]: Analyzing trace with hash -336916496, now seen corresponding path program 6 times [2019-12-18 21:54:00,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:00,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389095926] [2019-12-18 21:54:00,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:01,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389095926] [2019-12-18 21:54:01,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:01,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:54:01,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567037733] [2019-12-18 21:54:01,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:54:01,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:01,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:54:01,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:54:01,070 INFO L87 Difference]: Start difference. First operand 34422 states and 109173 transitions. Second operand 6 states. [2019-12-18 21:54:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:01,696 INFO L93 Difference]: Finished difference Result 55841 states and 177080 transitions. [2019-12-18 21:54:01,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:54:01,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 21:54:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:01,781 INFO L225 Difference]: With dead ends: 55841 [2019-12-18 21:54:01,781 INFO L226 Difference]: Without dead ends: 55841 [2019-12-18 21:54:01,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:54:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55841 states. [2019-12-18 21:54:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55841 to 36081. [2019-12-18 21:54:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36081 states. [2019-12-18 21:54:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36081 states to 36081 states and 115043 transitions. [2019-12-18 21:54:03,044 INFO L78 Accepts]: Start accepts. Automaton has 36081 states and 115043 transitions. Word has length 65 [2019-12-18 21:54:03,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:03,045 INFO L462 AbstractCegarLoop]: Abstraction has 36081 states and 115043 transitions. [2019-12-18 21:54:03,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:54:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36081 states and 115043 transitions. [2019-12-18 21:54:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:54:03,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:03,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:03,087 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:03,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:03,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1693200707, now seen corresponding path program 1 times [2019-12-18 21:54:03,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:03,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185953720] [2019-12-18 21:54:03,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:03,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185953720] [2019-12-18 21:54:03,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:03,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:54:03,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142302684] [2019-12-18 21:54:03,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:54:03,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:03,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:54:03,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:54:03,189 INFO L87 Difference]: Start difference. First operand 36081 states and 115043 transitions. Second operand 8 states. [2019-12-18 21:54:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:05,232 INFO L93 Difference]: Finished difference Result 66491 states and 204435 transitions. [2019-12-18 21:54:05,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:54:05,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 21:54:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:05,338 INFO L225 Difference]: With dead ends: 66491 [2019-12-18 21:54:05,338 INFO L226 Difference]: Without dead ends: 66070 [2019-12-18 21:54:05,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:54:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66070 states. [2019-12-18 21:54:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66070 to 40128. [2019-12-18 21:54:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40128 states. [2019-12-18 21:54:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40128 states to 40128 states and 127458 transitions. [2019-12-18 21:54:06,207 INFO L78 Accepts]: Start accepts. Automaton has 40128 states and 127458 transitions. Word has length 65 [2019-12-18 21:54:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:06,208 INFO L462 AbstractCegarLoop]: Abstraction has 40128 states and 127458 transitions. [2019-12-18 21:54:06,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:54:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 40128 states and 127458 transitions. [2019-12-18 21:54:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:54:06,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:06,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:06,254 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:06,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:06,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1177488359, now seen corresponding path program 2 times [2019-12-18 21:54:06,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:06,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591491327] [2019-12-18 21:54:06,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:06,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591491327] [2019-12-18 21:54:06,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:06,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:54:06,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668146538] [2019-12-18 21:54:06,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:54:06,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:06,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:54:06,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:54:06,431 INFO L87 Difference]: Start difference. First operand 40128 states and 127458 transitions. Second operand 9 states. [2019-12-18 21:54:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:08,605 INFO L93 Difference]: Finished difference Result 68127 states and 212489 transitions. [2019-12-18 21:54:08,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 21:54:08,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 21:54:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:08,760 INFO L225 Difference]: With dead ends: 68127 [2019-12-18 21:54:08,760 INFO L226 Difference]: Without dead ends: 67907 [2019-12-18 21:54:08,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:54:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67907 states. [2019-12-18 21:54:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67907 to 46536. [2019-12-18 21:54:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46536 states. [2019-12-18 21:54:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46536 states to 46536 states and 147572 transitions. [2019-12-18 21:54:10,051 INFO L78 Accepts]: Start accepts. Automaton has 46536 states and 147572 transitions. Word has length 65 [2019-12-18 21:54:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:10,051 INFO L462 AbstractCegarLoop]: Abstraction has 46536 states and 147572 transitions. [2019-12-18 21:54:10,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:54:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 46536 states and 147572 transitions. [2019-12-18 21:54:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:54:10,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:10,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] [2019-12-18 21:54:10,103 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:10,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1126590755, now seen corresponding path program 3 times [2019-12-18 21:54:10,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:10,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966493871] [2019-12-18 21:54:10,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:10,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966493871] [2019-12-18 21:54:10,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:10,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:54:10,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593643724] [2019-12-18 21:54:10,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:54:10,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:10,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:54:10,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:54:10,167 INFO L87 Difference]: Start difference. First operand 46536 states and 147572 transitions. Second operand 3 states. [2019-12-18 21:54:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:10,371 INFO L93 Difference]: Finished difference Result 38001 states and 118414 transitions. [2019-12-18 21:54:10,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:54:10,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:54:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:10,463 INFO L225 Difference]: With dead ends: 38001 [2019-12-18 21:54:10,463 INFO L226 Difference]: Without dead ends: 38001 [2019-12-18 21:54:10,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:54:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38001 states. [2019-12-18 21:54:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38001 to 36436. [2019-12-18 21:54:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36436 states. [2019-12-18 21:54:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36436 states to 36436 states and 113159 transitions. [2019-12-18 21:54:11,374 INFO L78 Accepts]: Start accepts. Automaton has 36436 states and 113159 transitions. Word has length 65 [2019-12-18 21:54:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:11,375 INFO L462 AbstractCegarLoop]: Abstraction has 36436 states and 113159 transitions. [2019-12-18 21:54:11,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:54:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 36436 states and 113159 transitions. [2019-12-18 21:54:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:54:11,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:11,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:11,448 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:11,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1355164724, now seen corresponding path program 1 times [2019-12-18 21:54:11,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:11,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176036510] [2019-12-18 21:54:11,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:11,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176036510] [2019-12-18 21:54:11,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:11,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:54:11,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623274705] [2019-12-18 21:54:11,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:54:11,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:54:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:54:11,547 INFO L87 Difference]: Start difference. First operand 36436 states and 113159 transitions. Second operand 4 states. [2019-12-18 21:54:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:11,796 INFO L93 Difference]: Finished difference Result 36436 states and 112929 transitions. [2019-12-18 21:54:11,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:54:11,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 21:54:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:11,874 INFO L225 Difference]: With dead ends: 36436 [2019-12-18 21:54:11,874 INFO L226 Difference]: Without dead ends: 36436 [2019-12-18 21:54:11,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:54:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36436 states. [2019-12-18 21:54:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36436 to 29134. [2019-12-18 21:54:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29134 states. [2019-12-18 21:54:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29134 states to 29134 states and 89390 transitions. [2019-12-18 21:54:12,378 INFO L78 Accepts]: Start accepts. Automaton has 29134 states and 89390 transitions. Word has length 66 [2019-12-18 21:54:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:12,379 INFO L462 AbstractCegarLoop]: Abstraction has 29134 states and 89390 transitions. [2019-12-18 21:54:12,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:54:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 29134 states and 89390 transitions. [2019-12-18 21:54:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:54:12,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:12,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:12,410 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1203029879, now seen corresponding path program 1 times [2019-12-18 21:54:12,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:12,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613987909] [2019-12-18 21:54:12,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:12,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613987909] [2019-12-18 21:54:12,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:12,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:54:12,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8633422] [2019-12-18 21:54:12,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:54:12,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:12,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:54:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:54:12,515 INFO L87 Difference]: Start difference. First operand 29134 states and 89390 transitions. Second operand 8 states. [2019-12-18 21:54:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:15,039 INFO L93 Difference]: Finished difference Result 44452 states and 133665 transitions. [2019-12-18 21:54:15,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 21:54:15,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 21:54:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:15,100 INFO L225 Difference]: With dead ends: 44452 [2019-12-18 21:54:15,100 INFO L226 Difference]: Without dead ends: 44452 [2019-12-18 21:54:15,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 21:54:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44452 states. [2019-12-18 21:54:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44452 to 30787. [2019-12-18 21:54:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30787 states. [2019-12-18 21:54:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30787 states to 30787 states and 94404 transitions. [2019-12-18 21:54:15,638 INFO L78 Accepts]: Start accepts. Automaton has 30787 states and 94404 transitions. Word has length 66 [2019-12-18 21:54:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:15,639 INFO L462 AbstractCegarLoop]: Abstraction has 30787 states and 94404 transitions. [2019-12-18 21:54:15,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:54:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 30787 states and 94404 transitions. [2019-12-18 21:54:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:54:15,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:15,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:15,671 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:15,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2086442143, now seen corresponding path program 2 times [2019-12-18 21:54:15,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:15,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770336275] [2019-12-18 21:54:15,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:15,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770336275] [2019-12-18 21:54:15,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:15,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:54:15,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282362623] [2019-12-18 21:54:15,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:54:15,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:15,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:54:15,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:54:15,872 INFO L87 Difference]: Start difference. First operand 30787 states and 94404 transitions. Second operand 11 states. [2019-12-18 21:54:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:17,085 INFO L93 Difference]: Finished difference Result 71195 states and 215707 transitions. [2019-12-18 21:54:17,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 21:54:17,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 21:54:17,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:17,166 INFO L225 Difference]: With dead ends: 71195 [2019-12-18 21:54:17,166 INFO L226 Difference]: Without dead ends: 56060 [2019-12-18 21:54:17,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 21:54:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56060 states. [2019-12-18 21:54:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56060 to 31181. [2019-12-18 21:54:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31181 states. [2019-12-18 21:54:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31181 states to 31181 states and 94984 transitions. [2019-12-18 21:54:17,810 INFO L78 Accepts]: Start accepts. Automaton has 31181 states and 94984 transitions. Word has length 66 [2019-12-18 21:54:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:17,810 INFO L462 AbstractCegarLoop]: Abstraction has 31181 states and 94984 transitions. [2019-12-18 21:54:17,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:54:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 31181 states and 94984 transitions. [2019-12-18 21:54:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:54:17,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:17,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:17,843 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:17,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:17,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1419140629, now seen corresponding path program 3 times [2019-12-18 21:54:17,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:17,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794798842] [2019-12-18 21:54:17,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:17,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794798842] [2019-12-18 21:54:17,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:17,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:54:17,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044750609] [2019-12-18 21:54:17,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:54:17,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:17,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:54:17,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:54:17,938 INFO L87 Difference]: Start difference. First operand 31181 states and 94984 transitions. Second operand 9 states. [2019-12-18 21:54:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:19,393 INFO L93 Difference]: Finished difference Result 48867 states and 147140 transitions. [2019-12-18 21:54:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:54:19,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 21:54:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:19,460 INFO L225 Difference]: With dead ends: 48867 [2019-12-18 21:54:19,460 INFO L226 Difference]: Without dead ends: 47861 [2019-12-18 21:54:19,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:54:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47861 states. [2019-12-18 21:54:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47861 to 30773. [2019-12-18 21:54:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30773 states. [2019-12-18 21:54:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30773 states to 30773 states and 93807 transitions. [2019-12-18 21:54:20,054 INFO L78 Accepts]: Start accepts. Automaton has 30773 states and 93807 transitions. Word has length 66 [2019-12-18 21:54:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:20,054 INFO L462 AbstractCegarLoop]: Abstraction has 30773 states and 93807 transitions. [2019-12-18 21:54:20,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:54:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 30773 states and 93807 transitions. [2019-12-18 21:54:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:54:20,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:20,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:20,088 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash 137206839, now seen corresponding path program 4 times [2019-12-18 21:54:20,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:20,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672182578] [2019-12-18 21:54:20,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:20,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672182578] [2019-12-18 21:54:20,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:20,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:54:20,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961197433] [2019-12-18 21:54:20,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:54:20,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:20,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:54:20,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:54:20,271 INFO L87 Difference]: Start difference. First operand 30773 states and 93807 transitions. Second operand 11 states. [2019-12-18 21:54:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:23,541 INFO L93 Difference]: Finished difference Result 53519 states and 160107 transitions. [2019-12-18 21:54:23,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 21:54:23,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 21:54:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:23,619 INFO L225 Difference]: With dead ends: 53519 [2019-12-18 21:54:23,619 INFO L226 Difference]: Without dead ends: 53295 [2019-12-18 21:54:23,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-12-18 21:54:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53295 states. [2019-12-18 21:54:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53295 to 29730. [2019-12-18 21:54:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29730 states. [2019-12-18 21:54:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29730 states to 29730 states and 90392 transitions. [2019-12-18 21:54:24,220 INFO L78 Accepts]: Start accepts. Automaton has 29730 states and 90392 transitions. Word has length 66 [2019-12-18 21:54:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:24,220 INFO L462 AbstractCegarLoop]: Abstraction has 29730 states and 90392 transitions. [2019-12-18 21:54:24,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:54:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 29730 states and 90392 transitions. [2019-12-18 21:54:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:54:24,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:24,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:24,253 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash 362402641, now seen corresponding path program 5 times [2019-12-18 21:54:24,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:24,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096262097] [2019-12-18 21:54:24,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:24,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096262097] [2019-12-18 21:54:24,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:24,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:54:24,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283746116] [2019-12-18 21:54:24,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:54:24,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:24,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:54:24,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:54:24,321 INFO L87 Difference]: Start difference. First operand 29730 states and 90392 transitions. Second operand 3 states. [2019-12-18 21:54:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:24,443 INFO L93 Difference]: Finished difference Result 29730 states and 90391 transitions. [2019-12-18 21:54:24,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:54:24,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:54:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:24,495 INFO L225 Difference]: With dead ends: 29730 [2019-12-18 21:54:24,496 INFO L226 Difference]: Without dead ends: 29730 [2019-12-18 21:54:24,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:54:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29730 states. [2019-12-18 21:54:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29730 to 22748. [2019-12-18 21:54:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22748 states. [2019-12-18 21:54:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22748 states to 22748 states and 70716 transitions. [2019-12-18 21:54:25,226 INFO L78 Accepts]: Start accepts. Automaton has 22748 states and 70716 transitions. Word has length 66 [2019-12-18 21:54:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:25,227 INFO L462 AbstractCegarLoop]: Abstraction has 22748 states and 70716 transitions. [2019-12-18 21:54:25,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:54:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 22748 states and 70716 transitions. [2019-12-18 21:54:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:54:25,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:25,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:25,253 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:54:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:25,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1110522546, now seen corresponding path program 1 times [2019-12-18 21:54:25,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:25,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455991408] [2019-12-18 21:54:25,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:54:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:54:25,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455991408] [2019-12-18 21:54:25,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:54:25,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:54:25,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388956139] [2019-12-18 21:54:25,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:54:25,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:54:25,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:54:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:54:25,414 INFO L87 Difference]: Start difference. First operand 22748 states and 70716 transitions. Second operand 11 states. [2019-12-18 21:54:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:54:27,083 INFO L93 Difference]: Finished difference Result 28098 states and 86144 transitions. [2019-12-18 21:54:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:54:27,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:54:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:54:27,123 INFO L225 Difference]: With dead ends: 28098 [2019-12-18 21:54:27,123 INFO L226 Difference]: Without dead ends: 27665 [2019-12-18 21:54:27,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:54:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27665 states. [2019-12-18 21:54:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27665 to 22494. [2019-12-18 21:54:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22494 states. [2019-12-18 21:54:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22494 states to 22494 states and 70072 transitions. [2019-12-18 21:54:27,493 INFO L78 Accepts]: Start accepts. Automaton has 22494 states and 70072 transitions. Word has length 67 [2019-12-18 21:54:27,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:54:27,493 INFO L462 AbstractCegarLoop]: Abstraction has 22494 states and 70072 transitions. [2019-12-18 21:54:27,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:54:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 22494 states and 70072 transitions. [2019-12-18 21:54:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:54:27,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:54:27,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:54:27,517 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-18 21:54:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:54:27,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1370876380, now seen corresponding path program 2 times [2019-12-18 21:54:27,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:54:27,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613758537] [2019-12-18 21:54:27,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:54:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:54:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:54:27,643 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:54:27,644 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:54:27,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~z$w_buff0_used~0_115 0) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_76 0) (= v_~main$tmp_guard1~0_16 0) (= v_~z$r_buff0_thd0~0_20 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_28 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_24|) 0) (= 0 v_~z$w_buff1~0_28) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~z$flush_delayed~0_13) (= 0 v_~__unbuffered_cnt~0_21) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1489~0.base_24|) |v_ULTIMATE.start_main_~#t1489~0.offset_18| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= 0 v_~z$r_buff1_thd3~0_51) (= 0 v_~z$r_buff1_thd1~0_18) (= v_~y~0_16 0) (= v_~x~0_17 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~z$r_buff1_thd0~0_23) (= 0 v_~weak$$choice0~0_7) (= v_~z$mem_tmp~0_10 0) (= |v_ULTIMATE.start_main_~#t1489~0.offset_18| 0) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1489~0.base_24|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1489~0.base_24| 4) |v_#length_21|) (= 0 v_~z$w_buff1_used~0_78) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~weak$$choice2~0_31) (= 0 v_~z$w_buff0~0_29) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1489~0.base_24| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_24|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_28, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, 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~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~y~0=v_~y~0_16, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_~#t1489~0.base=|v_ULTIMATE.start_main_~#t1489~0.base_24|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_29, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_51, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_78, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1489~0.offset=|v_ULTIMATE.start_main_~#t1489~0.offset_18|, #NULL.base=|v_#NULL.base_7|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_60|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, #memory_int=|v_#memory_int_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_76, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1491~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1489~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1491~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1489~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t1490~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 21:54:27,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1490~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1490~0.base_13|) |v_ULTIMATE.start_main_~#t1490~0.offset_11| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1490~0.base_13| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t1490~0.base_13| 0)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1490~0.base_13| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t1490~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1490~0.base=|v_ULTIMATE.start_main_~#t1490~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1490~0.offset=|v_ULTIMATE.start_main_~#t1490~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1490~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1490~0.offset, #length] because there is no mapped edge [2019-12-18 21:54:27,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1491~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1491~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1491~0.base_13| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1491~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1491~0.base_13|) |v_ULTIMATE.start_main_~#t1491~0.offset_11| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1491~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1491~0.offset=|v_ULTIMATE.start_main_~#t1491~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1491~0.base=|v_ULTIMATE.start_main_~#t1491~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1491~0.offset, #length, ULTIMATE.start_main_~#t1491~0.base] because there is no mapped edge [2019-12-18 21:54:27,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_16 v_~z$w_buff1~0_17) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 1 v_~z$w_buff0~0_15) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_86 v_~z$w_buff1_used~0_59) (= (mod v_~z$w_buff1_used~0_59 256) 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_85 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_86, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_85, ~z$w_buff0~0=v_~z$w_buff0~0_15, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_59, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_17, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:54:27,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L784-->L784-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In874039932 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite21_Out874039932| |P2Thread1of1ForFork2_#t~ite20_Out874039932|) .cse0 (= ~z$w_buff0~0_In874039932 |P2Thread1of1ForFork2_#t~ite20_Out874039932|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In874039932 256) 0))) (or (= (mod ~z$w_buff0_used~0_In874039932 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In874039932 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In874039932 256)))))) (and (= ~z$w_buff0~0_In874039932 |P2Thread1of1ForFork2_#t~ite21_Out874039932|) (= |P2Thread1of1ForFork2_#t~ite20_In874039932| |P2Thread1of1ForFork2_#t~ite20_Out874039932|) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In874039932, ~z$w_buff0_used~0=~z$w_buff0_used~0_In874039932, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In874039932|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In874039932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874039932, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In874039932, ~weak$$choice2~0=~weak$$choice2~0_In874039932} OutVars{~z$w_buff0~0=~z$w_buff0~0_In874039932, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out874039932|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In874039932, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out874039932|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In874039932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874039932, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In874039932, ~weak$$choice2~0=~weak$$choice2~0_In874039932} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 21:54:27,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1889061877| |P1Thread1of1ForFork1_#t~ite10_Out-1889061877|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1889061877 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1889061877 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1889061877| ~z~0_In-1889061877) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out-1889061877| ~z$w_buff1~0_In-1889061877)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1889061877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1889061877, ~z$w_buff1~0=~z$w_buff1~0_In-1889061877, ~z~0=~z~0_In-1889061877} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1889061877|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1889061877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1889061877, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1889061877|, ~z$w_buff1~0=~z$w_buff1~0_In-1889061877, ~z~0=~z~0_In-1889061877} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 21:54:27,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In424919007 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In424919007 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out424919007|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In424919007 |P0Thread1of1ForFork0_#t~ite5_Out424919007|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In424919007, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In424919007} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out424919007|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In424919007, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In424919007} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:54:27,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In107551657 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In107551657 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In107551657 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In107551657 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out107551657|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In107551657 |P0Thread1of1ForFork0_#t~ite6_Out107551657|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In107551657, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In107551657, ~z$w_buff1_used~0=~z$w_buff1_used~0_In107551657, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In107551657} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out107551657|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In107551657, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In107551657, ~z$w_buff1_used~0=~z$w_buff1_used~0_In107551657, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In107551657} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:54:27,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1118954900 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1118954900 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out-1118954900) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1118954900 ~z$r_buff0_thd1~0_Out-1118954900)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118954900, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1118954900} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1118954900, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1118954900|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1118954900} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:54:27,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-746962730 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-746962730 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-746962730|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-746962730| ~z$w_buff0_used~0_In-746962730)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-746962730, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-746962730} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-746962730, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-746962730|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-746962730} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:54:27,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-671459282 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-671459282 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-671459282 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-671459282 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-671459282|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-671459282 |P1Thread1of1ForFork1_#t~ite12_Out-671459282|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-671459282, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-671459282, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-671459282, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-671459282} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-671459282, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-671459282, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-671459282, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-671459282|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-671459282} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:54:27,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-512995163 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-512995163 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-512995163| 0)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-512995163| ~z$r_buff0_thd2~0_In-512995163) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-512995163, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-512995163} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-512995163, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-512995163|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-512995163} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 21:54:27,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1535870353 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1535870353 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1535870353 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1535870353 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-1535870353 |P1Thread1of1ForFork1_#t~ite14_Out-1535870353|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1535870353|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535870353, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1535870353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535870353, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1535870353} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535870353, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1535870353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535870353, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1535870353|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1535870353} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:54:27,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:54:27,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd3~0_64 v_~z$r_buff0_thd3~0_63)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:54:27,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-24371176 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-24371176 256)))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In-24371176 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-24371176 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-24371176 256))))) (= |P2Thread1of1ForFork2_#t~ite36_Out-24371176| |P2Thread1of1ForFork2_#t~ite35_Out-24371176|) (= |P2Thread1of1ForFork2_#t~ite35_Out-24371176| ~z$r_buff1_thd3~0_In-24371176) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite36_Out-24371176| ~z$r_buff1_thd3~0_In-24371176) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite35_In-24371176| |P2Thread1of1ForFork2_#t~ite35_Out-24371176|)))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In-24371176|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24371176, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-24371176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24371176, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24371176, ~weak$$choice2~0=~weak$$choice2~0_In-24371176} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-24371176|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-24371176|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24371176, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-24371176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24371176, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24371176, ~weak$$choice2~0=~weak$$choice2~0_In-24371176} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 21:54:27,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:54:27,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-545111722 256) 0)) (.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-545111722| |P2Thread1of1ForFork2_#t~ite39_Out-545111722|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-545111722 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out-545111722| ~z~0_In-545111722)) (and (not .cse1) .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-545111722| ~z$w_buff1~0_In-545111722) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-545111722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545111722, ~z$w_buff1~0=~z$w_buff1~0_In-545111722, ~z~0=~z~0_In-545111722} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-545111722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545111722, ~z$w_buff1~0=~z$w_buff1~0_In-545111722, ~z~0=~z~0_In-545111722, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-545111722|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-545111722|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 21:54:27,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1790235750 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1790235750 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1790235750|)) (and (= ~z$w_buff0_used~0_In1790235750 |P2Thread1of1ForFork2_#t~ite40_Out1790235750|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1790235750, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1790235750} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1790235750, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1790235750, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1790235750|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 21:54:27,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2068028392 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In2068028392 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In2068028392 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2068028392 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out2068028392| ~z$w_buff1_used~0_In2068028392) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out2068028392| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2068028392, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2068028392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068028392, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2068028392} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out2068028392|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068028392, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2068028392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068028392, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2068028392} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 21:54:27,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1844581194 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1844581194 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-1844581194| ~z$r_buff0_thd3~0_In-1844581194) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1844581194| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844581194, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1844581194} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1844581194|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844581194, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1844581194} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 21:54:27,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1123886033 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1123886033 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1123886033 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1123886033 256)))) (or (and (= ~z$r_buff1_thd3~0_In1123886033 |P2Thread1of1ForFork2_#t~ite43_Out1123886033|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out1123886033| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1123886033, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1123886033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1123886033, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1123886033} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1123886033, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1123886033, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1123886033|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1123886033, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1123886033} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 21:54:27,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_44) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 21:54:27,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1923532022 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1923532022 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1923532022 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1923532022 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1923532022|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1923532022| ~z$r_buff1_thd1~0_In-1923532022)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1923532022, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1923532022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1923532022, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1923532022} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1923532022, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1923532022|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1923532022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1923532022, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1923532022} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:54:27,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:54:27,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: 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-18 21:54:27,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In264114810 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In264114810 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out264114810| |ULTIMATE.start_main_#t~ite47_Out264114810|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out264114810| ~z$w_buff1~0_In264114810) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite47_Out264114810| ~z~0_In264114810)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In264114810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264114810, ~z$w_buff1~0=~z$w_buff1~0_In264114810, ~z~0=~z~0_In264114810} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In264114810, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out264114810|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264114810, ~z$w_buff1~0=~z$w_buff1~0_In264114810, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out264114810|, ~z~0=~z~0_In264114810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:54:27,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In43605026 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In43605026 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out43605026| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out43605026| ~z$w_buff0_used~0_In43605026) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In43605026, ~z$w_buff0_used~0=~z$w_buff0_used~0_In43605026} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In43605026, ~z$w_buff0_used~0=~z$w_buff0_used~0_In43605026, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out43605026|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:54:27,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1151706998 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1151706998 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1151706998 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1151706998 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1151706998| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1151706998 |ULTIMATE.start_main_#t~ite50_Out-1151706998|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1151706998, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151706998, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1151706998, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151706998} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1151706998|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1151706998, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151706998, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1151706998, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151706998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:54:27,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1880194103 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1880194103 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out1880194103| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1880194103 |ULTIMATE.start_main_#t~ite51_Out1880194103|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1880194103, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1880194103} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1880194103, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1880194103|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1880194103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:54:27,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1444549271 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1444549271 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1444549271 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1444549271 256)))) (or (and (= ~z$r_buff1_thd0~0_In1444549271 |ULTIMATE.start_main_#t~ite52_Out1444549271|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1444549271|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1444549271, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1444549271, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1444549271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1444549271} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1444549271|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1444549271, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1444549271, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1444549271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1444549271} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:54:27,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_10 2) (= v_~__unbuffered_p2_EAX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~x~0_11 2) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~z$r_buff1_thd0~0_16)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_10, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_10, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:54:27,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:54:27 BasicIcfg [2019-12-18 21:54:27,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:54:27,803 INFO L168 Benchmark]: Toolchain (without parser) took 131153.55 ms. Allocated memory was 144.2 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 21:54:27,804 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:54:27,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.47 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.9 MB in the beginning and 155.7 MB in the end (delta: -56.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:54:27,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.83 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:54:27,805 INFO L168 Benchmark]: Boogie Preprocessor took 40.21 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:54:27,805 INFO L168 Benchmark]: RCFGBuilder took 909.78 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 101.0 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:54:27,805 INFO L168 Benchmark]: TraceAbstraction took 129325.21 ms. Allocated memory was 201.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 21:54:27,808 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.47 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.9 MB in the beginning and 155.7 MB in the end (delta: -56.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.83 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.21 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 909.78 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 101.0 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129325.21 ms. Allocated memory was 201.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 174 ProgramPointsBefore, 95 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 30 ChoiceCompositions, 6362 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81192 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L784] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 128.9s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 47.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10339 SDtfs, 13708 SDslu, 33801 SDs, 0 SdLazy, 20367 SolverSat, 712 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 141 SyntacticMatches, 29 SemanticMatches, 441 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154366occurred 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: 53.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 747236 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1884 NumberOfCodeBlocks, 1884 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 346552 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...