/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:32:01,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:32:01,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:32:01,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:32:01,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:32:01,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:32:01,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:32:01,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:32:01,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:32:01,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:32:01,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:32:01,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:32:01,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:32:01,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:32:01,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:32:01,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:32:01,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:32:01,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:32:01,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:32:01,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:32:01,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:32:01,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:32:01,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:32:01,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:32:01,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:32:01,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:32:01,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:32:01,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:32:01,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:32:01,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:32:01,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:32:01,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:32:01,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:32:01,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:32:01,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:32:01,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:32:01,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:32:01,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:32:01,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:32:01,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:32:01,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:32:01,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:32:01,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:32:01,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:32:01,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:32:01,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:32:01,428 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:32:01,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:32:01,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:32:01,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:32:01,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:32:01,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:32:01,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:32:01,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:32:01,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:32:01,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:32:01,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:32:01,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:32:01,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:32:01,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:32:01,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:32:01,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:32:01,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:32:01,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:32:01,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:32:01,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:32:01,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:32:01,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:32:01,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:32:01,434 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:32:01,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:32:01,435 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:32:01,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:32:01,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:32:01,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:32:01,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:32:01,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:32:01,711 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:32:01,711 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-27 15:32:01,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0a001df/4d635510e35946e3817620bb00e2c79f/FLAGb58ed965e [2019-12-27 15:32:02,344 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:32:02,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.oepc.i [2019-12-27 15:32:02,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0a001df/4d635510e35946e3817620bb00e2c79f/FLAGb58ed965e [2019-12-27 15:32:02,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0a001df/4d635510e35946e3817620bb00e2c79f [2019-12-27 15:32:02,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:32:02,664 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:32:02,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:32:02,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:32:02,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:32:02,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:32:02" (1/1) ... [2019-12-27 15:32:02,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1e95ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:02, skipping insertion in model container [2019-12-27 15:32:02,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:32:02" (1/1) ... [2019-12-27 15:32:02,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:32:02,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:32:03,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:32:03,317 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:32:03,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:32:03,459 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:32:03,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03 WrapperNode [2019-12-27 15:32:03,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:32:03,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:32:03,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:32:03,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:32:03,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... [2019-12-27 15:32:03,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... [2019-12-27 15:32:03,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:32:03,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:32:03,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:32:03,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:32:03,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... [2019-12-27 15:32:03,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... [2019-12-27 15:32:03,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... [2019-12-27 15:32:03,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... [2019-12-27 15:32:03,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... [2019-12-27 15:32:03,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... [2019-12-27 15:32:03,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... [2019-12-27 15:32:03,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:32:03,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:32:03,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:32:03,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:32:03,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:32:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:32:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:32:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:32:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:32:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:32:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:32:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:32:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:32:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:32:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:32:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:32:03,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:32:03,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:32:03,654 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:32:04,390 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:32:04,391 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:32:04,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:32:04 BoogieIcfgContainer [2019-12-27 15:32:04,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:32:04,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:32:04,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:32:04,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:32:04,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:32:02" (1/3) ... [2019-12-27 15:32:04,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fe6124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:32:04, skipping insertion in model container [2019-12-27 15:32:04,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:32:03" (2/3) ... [2019-12-27 15:32:04,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fe6124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:32:04, skipping insertion in model container [2019-12-27 15:32:04,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:32:04" (3/3) ... [2019-12-27 15:32:04,401 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_power.oepc.i [2019-12-27 15:32:04,411 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:32:04,411 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:32:04,423 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:32:04,424 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:32:04,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,487 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,487 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,487 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,497 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,497 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,575 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,591 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,591 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,591 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,594 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,594 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:32:04,617 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:32:04,632 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:32:04,632 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:32:04,632 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:32:04,633 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:32:04,633 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:32:04,633 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:32:04,633 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:32:04,633 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:32:04,647 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 15:32:04,649 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 15:32:04,761 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 15:32:04,762 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:32:04,780 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:32:04,802 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 15:32:04,859 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 15:32:04,859 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:32:04,867 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:32:04,889 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:32:04,890 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:32:10,020 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 15:32:10,152 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 15:32:10,532 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-27 15:32:10,532 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 15:32:10,536 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 15:32:30,374 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-27 15:32:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-27 15:32:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:32:30,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:30,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:32:30,382 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:32:30,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:30,386 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-27 15:32:30,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:30,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20508568] [2019-12-27 15:32:30,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:32:30,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20508568] [2019-12-27 15:32:30,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:30,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:32:30,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1206841254] [2019-12-27 15:32:30,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:30,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:30,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:32:30,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:30,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:30,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:32:30,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:32:30,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:30,637 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-27 15:32:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:32,222 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-27 15:32:32,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:32:32,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:32:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:36,053 INFO L225 Difference]: With dead ends: 119613 [2019-12-27 15:32:36,053 INFO L226 Difference]: Without dead ends: 105755 [2019-12-27 15:32:36,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:32:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-27 15:32:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-27 15:32:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-27 15:32:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-27 15:32:43,262 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-27 15:32:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:32:43,262 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-27 15:32:43,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:32:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-27 15:32:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:32:43,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:32:43,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:32:43,267 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:32:43,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:32:43,267 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-27 15:32:43,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:32:43,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199106619] [2019-12-27 15:32:43,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:32:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:32:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:32:43,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199106619] [2019-12-27 15:32:43,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:32:43,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:32:43,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [658619177] [2019-12-27 15:32:43,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:32:43,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:32:43,421 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:32:43,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:32:43,424 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:32:43,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:32:43,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:32:43,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:32:43,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:32:43,425 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-27 15:32:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:32:48,893 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-27 15:32:48,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:32:48,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:32:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:32:49,509 INFO L225 Difference]: With dead ends: 168845 [2019-12-27 15:32:49,510 INFO L226 Difference]: Without dead ends: 168747 [2019-12-27 15:32:49,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:32:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-27 15:33:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-27 15:33:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-27 15:33:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-27 15:33:01,975 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-27 15:33:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:01,976 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-27 15:33:01,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-27 15:33:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:33:01,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:01,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:01,982 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-27 15:33:01,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:01,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221436158] [2019-12-27 15:33:01,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:02,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221436158] [2019-12-27 15:33:02,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:02,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:02,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305955108] [2019-12-27 15:33:02,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:02,042 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:02,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:33:02,043 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:02,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:02,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:02,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:02,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:02,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:02,045 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-27 15:33:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:06,510 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-27 15:33:06,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:06,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:33:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:06,618 INFO L225 Difference]: With dead ends: 33476 [2019-12-27 15:33:06,619 INFO L226 Difference]: Without dead ends: 33476 [2019-12-27 15:33:06,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-27 15:33:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-27 15:33:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-27 15:33:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-27 15:33:07,370 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-27 15:33:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:07,370 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-27 15:33:07,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-27 15:33:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:33:07,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:07,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:07,374 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-27 15:33:07,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:07,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038194992] [2019-12-27 15:33:07,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:07,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038194992] [2019-12-27 15:33:07,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:07,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:07,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [213579357] [2019-12-27 15:33:07,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:07,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:07,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:33:07,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:07,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:07,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:07,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:07,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:07,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:07,507 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-27 15:33:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:07,857 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-27 15:33:07,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:33:07,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 15:33:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:07,927 INFO L225 Difference]: With dead ends: 41508 [2019-12-27 15:33:07,927 INFO L226 Difference]: Without dead ends: 41508 [2019-12-27 15:33:07,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:33:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-27 15:33:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-27 15:33:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-27 15:33:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-27 15:33:08,614 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-27 15:33:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:08,615 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-27 15:33:08,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-27 15:33:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:33:08,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:08,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:08,618 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:08,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-27 15:33:08,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:08,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340848961] [2019-12-27 15:33:08,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:08,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340848961] [2019-12-27 15:33:08,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:08,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:08,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [687287429] [2019-12-27 15:33:08,674 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:08,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:08,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:33:08,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:08,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:08,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:08,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:08,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:08,680 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-27 15:33:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:09,220 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-27 15:33:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:09,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 15:33:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:09,335 INFO L225 Difference]: With dead ends: 54855 [2019-12-27 15:33:09,335 INFO L226 Difference]: Without dead ends: 54855 [2019-12-27 15:33:09,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-27 15:33:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-27 15:33:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-27 15:33:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-27 15:33:10,208 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-27 15:33:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:10,208 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-27 15:33:10,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-27 15:33:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:33:10,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:10,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:10,215 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-27 15:33:10,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:10,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053291272] [2019-12-27 15:33:10,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:10,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053291272] [2019-12-27 15:33:10,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:10,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:10,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1326722559] [2019-12-27 15:33:10,297 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:10,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:10,304 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:33:10,304 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:10,304 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:10,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:10,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:10,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:10,305 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-27 15:33:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:10,729 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-27 15:33:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:33:10,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 15:33:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:10,814 INFO L225 Difference]: With dead ends: 49903 [2019-12-27 15:33:10,815 INFO L226 Difference]: Without dead ends: 49903 [2019-12-27 15:33:10,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:33:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-27 15:33:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-27 15:33:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-27 15:33:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-27 15:33:12,160 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-27 15:33:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:12,160 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-27 15:33:12,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:12,160 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-27 15:33:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:33:12,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:12,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:12,170 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-27 15:33:12,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:12,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916701128] [2019-12-27 15:33:12,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:12,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916701128] [2019-12-27 15:33:12,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:12,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:12,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1728131499] [2019-12-27 15:33:12,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:12,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:12,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:33:12,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:12,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:12,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:33:12,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:33:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:33:12,313 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 6 states. [2019-12-27 15:33:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:13,099 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-27 15:33:13,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:33:13,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:33:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:13,213 INFO L225 Difference]: With dead ends: 59763 [2019-12-27 15:33:13,213 INFO L226 Difference]: Without dead ends: 59749 [2019-12-27 15:33:13,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:33:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-27 15:33:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-27 15:33:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-27 15:33:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-27 15:33:14,098 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-27 15:33:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:14,098 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-27 15:33:14,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:33:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-27 15:33:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:33:14,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:14,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:14,107 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:14,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-27 15:33:14,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:14,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663546804] [2019-12-27 15:33:14,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:14,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663546804] [2019-12-27 15:33:14,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:14,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:14,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [335269741] [2019-12-27 15:33:14,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:14,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:14,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:33:14,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:14,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:14,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:33:14,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:33:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:33:14,224 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 6 states. [2019-12-27 15:33:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:15,126 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-27 15:33:15,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:33:15,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:33:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:15,236 INFO L225 Difference]: With dead ends: 62779 [2019-12-27 15:33:15,237 INFO L226 Difference]: Without dead ends: 62765 [2019-12-27 15:33:15,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:33:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-27 15:33:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-27 15:33:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-27 15:33:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-27 15:33:16,520 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-27 15:33:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:16,520 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-27 15:33:16,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:33:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-27 15:33:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:33:16,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:16,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:16,532 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:16,532 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-27 15:33:16,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:16,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227454764] [2019-12-27 15:33:16,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:16,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227454764] [2019-12-27 15:33:16,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:16,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:16,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1654130643] [2019-12-27 15:33:16,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:16,595 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:16,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:33:16,605 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:16,625 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:33:16,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:33:16,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:33:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:33:16,626 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 5 states. [2019-12-27 15:33:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:16,711 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-27 15:33:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:33:16,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 15:33:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:16,737 INFO L225 Difference]: With dead ends: 17503 [2019-12-27 15:33:16,737 INFO L226 Difference]: Without dead ends: 17503 [2019-12-27 15:33:16,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:33:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-27 15:33:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-27 15:33:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-27 15:33:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-27 15:33:17,011 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-27 15:33:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:17,011 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-27 15:33:17,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:33:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-27 15:33:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:33:17,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:17,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:17,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:17,025 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-27 15:33:17,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:17,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414014430] [2019-12-27 15:33:17,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:17,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414014430] [2019-12-27 15:33:17,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:17,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:17,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504952776] [2019-12-27 15:33:17,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:17,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:17,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:33:17,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:17,083 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:17,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:17,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:17,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:17,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:17,084 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-27 15:33:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:17,196 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-27 15:33:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:17,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 15:33:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:17,226 INFO L225 Difference]: With dead ends: 22571 [2019-12-27 15:33:17,227 INFO L226 Difference]: Without dead ends: 22571 [2019-12-27 15:33:17,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-27 15:33:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-27 15:33:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-27 15:33:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-27 15:33:17,528 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-27 15:33:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:17,528 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-27 15:33:17,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-27 15:33:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:33:17,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:17,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:17,540 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-27 15:33:17,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:17,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861875383] [2019-12-27 15:33:17,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:17,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861875383] [2019-12-27 15:33:17,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:17,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:17,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [262080724] [2019-12-27 15:33:17,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:17,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:17,604 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:33:17,604 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:17,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:17,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:33:17,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:17,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:33:17,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:33:17,606 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-27 15:33:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:17,939 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-27 15:33:17,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:33:17,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 15:33:17,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:17,968 INFO L225 Difference]: With dead ends: 21146 [2019-12-27 15:33:17,968 INFO L226 Difference]: Without dead ends: 21146 [2019-12-27 15:33:17,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:33:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-27 15:33:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-27 15:33:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-27 15:33:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-27 15:33:18,275 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-27 15:33:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:18,275 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-27 15:33:18,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:33:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-27 15:33:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 15:33:18,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:18,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:18,290 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-27 15:33:18,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:18,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005230262] [2019-12-27 15:33:18,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:18,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005230262] [2019-12-27 15:33:18,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:18,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:18,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1358114466] [2019-12-27 15:33:18,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:18,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:18,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 15:33:18,388 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:18,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:18,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:33:18,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:33:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:33:18,391 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-27 15:33:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:18,790 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-27 15:33:18,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:33:18,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 15:33:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:18,834 INFO L225 Difference]: With dead ends: 23192 [2019-12-27 15:33:18,834 INFO L226 Difference]: Without dead ends: 23192 [2019-12-27 15:33:18,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:33:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-27 15:33:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-27 15:33:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-27 15:33:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-27 15:33:19,622 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-27 15:33:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:19,622 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-27 15:33:19,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:33:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-27 15:33:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:33:19,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:19,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:19,650 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-27 15:33:19,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:19,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809880255] [2019-12-27 15:33:19,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:19,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809880255] [2019-12-27 15:33:19,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:19,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:33:19,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545605263] [2019-12-27 15:33:19,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:19,762 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:19,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 15:33:19,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:19,792 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:19,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:33:19,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:19,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:33:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:33:19,793 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 7 states. [2019-12-27 15:33:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:20,664 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-27 15:33:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:33:20,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:33:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:20,701 INFO L225 Difference]: With dead ends: 26785 [2019-12-27 15:33:20,701 INFO L226 Difference]: Without dead ends: 26785 [2019-12-27 15:33:20,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:33:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-27 15:33:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-27 15:33:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-27 15:33:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-27 15:33:21,077 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-27 15:33:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:21,078 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-27 15:33:21,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:33:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-27 15:33:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:33:21,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:21,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:21,100 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-27 15:33:21,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:21,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111585875] [2019-12-27 15:33:21,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:21,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111585875] [2019-12-27 15:33:21,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:21,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:33:21,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1543909877] [2019-12-27 15:33:21,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:21,191 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:21,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 15:33:21,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:21,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:21,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:33:21,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:33:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:33:21,225 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 7 states. [2019-12-27 15:33:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:22,149 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-27 15:33:22,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:33:22,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 15:33:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:22,183 INFO L225 Difference]: With dead ends: 25915 [2019-12-27 15:33:22,183 INFO L226 Difference]: Without dead ends: 25915 [2019-12-27 15:33:22,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:33:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-27 15:33:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-27 15:33:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-27 15:33:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-27 15:33:22,512 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-27 15:33:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:22,512 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-27 15:33:22,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:33:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-27 15:33:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:33:22,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:22,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:22,530 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:22,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:22,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-27 15:33:22,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:22,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528363971] [2019-12-27 15:33:22,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:22,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528363971] [2019-12-27 15:33:22,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:22,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:33:22,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124703702] [2019-12-27 15:33:22,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:22,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:22,637 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 271 transitions. [2019-12-27 15:33:22,637 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:22,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:33:22,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:22,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:22,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:22,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:22,639 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-27 15:33:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:22,710 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-27 15:33:22,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:22,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:33:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:22,735 INFO L225 Difference]: With dead ends: 17953 [2019-12-27 15:33:22,735 INFO L226 Difference]: Without dead ends: 17953 [2019-12-27 15:33:22,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-27 15:33:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-27 15:33:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-27 15:33:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-27 15:33:23,000 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-27 15:33:23,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:23,000 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-27 15:33:23,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-27 15:33:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:33:23,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:23,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:23,017 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:23,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:23,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-27 15:33:23,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:23,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548142479] [2019-12-27 15:33:23,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:23,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548142479] [2019-12-27 15:33:23,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:23,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:33:23,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [120207329] [2019-12-27 15:33:23,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:23,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:23,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 331 transitions. [2019-12-27 15:33:23,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:23,359 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:33:23,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:33:23,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:23,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:33:23,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:33:23,360 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 7 states. [2019-12-27 15:33:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:23,460 INFO L93 Difference]: Finished difference Result 16745 states and 50707 transitions. [2019-12-27 15:33:23,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:33:23,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 15:33:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:23,488 INFO L225 Difference]: With dead ends: 16745 [2019-12-27 15:33:23,489 INFO L226 Difference]: Without dead ends: 16745 [2019-12-27 15:33:23,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:33:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16745 states. [2019-12-27 15:33:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16745 to 16164. [2019-12-27 15:33:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16164 states. [2019-12-27 15:33:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16164 states to 16164 states and 49138 transitions. [2019-12-27 15:33:23,923 INFO L78 Accepts]: Start accepts. Automaton has 16164 states and 49138 transitions. Word has length 40 [2019-12-27 15:33:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:23,923 INFO L462 AbstractCegarLoop]: Abstraction has 16164 states and 49138 transitions. [2019-12-27 15:33:23,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:33:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 16164 states and 49138 transitions. [2019-12-27 15:33:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:33:23,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:23,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:23,948 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:23,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:23,948 INFO L82 PathProgramCache]: Analyzing trace with hash -707354115, now seen corresponding path program 1 times [2019-12-27 15:33:23,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:23,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386151204] [2019-12-27 15:33:23,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:24,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386151204] [2019-12-27 15:33:24,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:24,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:33:24,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1549147447] [2019-12-27 15:33:24,064 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:24,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:24,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 292 states and 564 transitions. [2019-12-27 15:33:24,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:24,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:33:24,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:33:24,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:33:24,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:33:24,370 INFO L87 Difference]: Start difference. First operand 16164 states and 49138 transitions. Second operand 9 states. [2019-12-27 15:33:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:27,633 INFO L93 Difference]: Finished difference Result 75546 states and 224490 transitions. [2019-12-27 15:33:27,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 15:33:27,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 15:33:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:27,714 INFO L225 Difference]: With dead ends: 75546 [2019-12-27 15:33:27,714 INFO L226 Difference]: Without dead ends: 59099 [2019-12-27 15:33:27,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:33:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59099 states. [2019-12-27 15:33:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59099 to 19812. [2019-12-27 15:33:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19812 states. [2019-12-27 15:33:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19812 states to 19812 states and 60413 transitions. [2019-12-27 15:33:28,330 INFO L78 Accepts]: Start accepts. Automaton has 19812 states and 60413 transitions. Word has length 64 [2019-12-27 15:33:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:28,330 INFO L462 AbstractCegarLoop]: Abstraction has 19812 states and 60413 transitions. [2019-12-27 15:33:28,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:33:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 19812 states and 60413 transitions. [2019-12-27 15:33:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:33:28,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:28,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:28,359 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash -919693373, now seen corresponding path program 2 times [2019-12-27 15:33:28,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:28,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027920037] [2019-12-27 15:33:28,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:28,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027920037] [2019-12-27 15:33:28,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:28,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:33:28,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [48554892] [2019-12-27 15:33:28,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:28,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:28,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 293 states and 569 transitions. [2019-12-27 15:33:28,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:28,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:33:28,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:33:28,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:28,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:33:28,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:33:28,838 INFO L87 Difference]: Start difference. First operand 19812 states and 60413 transitions. Second operand 8 states. [2019-12-27 15:33:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:31,069 INFO L93 Difference]: Finished difference Result 64683 states and 193687 transitions. [2019-12-27 15:33:31,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 15:33:31,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 15:33:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:31,135 INFO L225 Difference]: With dead ends: 64683 [2019-12-27 15:33:31,135 INFO L226 Difference]: Without dead ends: 48060 [2019-12-27 15:33:31,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:33:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48060 states. [2019-12-27 15:33:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48060 to 23243. [2019-12-27 15:33:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23243 states. [2019-12-27 15:33:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23243 states to 23243 states and 70535 transitions. [2019-12-27 15:33:31,690 INFO L78 Accepts]: Start accepts. Automaton has 23243 states and 70535 transitions. Word has length 64 [2019-12-27 15:33:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:31,691 INFO L462 AbstractCegarLoop]: Abstraction has 23243 states and 70535 transitions. [2019-12-27 15:33:31,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:33:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 23243 states and 70535 transitions. [2019-12-27 15:33:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:33:31,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:31,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:31,721 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1837972597, now seen corresponding path program 3 times [2019-12-27 15:33:31,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:31,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118166599] [2019-12-27 15:33:31,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:31,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118166599] [2019-12-27 15:33:31,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:31,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:33:31,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [731097361] [2019-12-27 15:33:31,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:31,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:32,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 419 transitions. [2019-12-27 15:33:32,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:32,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 15:33:32,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:33:32,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:32,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:33:32,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:33:32,237 INFO L87 Difference]: Start difference. First operand 23243 states and 70535 transitions. Second operand 9 states. [2019-12-27 15:33:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:33,585 INFO L93 Difference]: Finished difference Result 80712 states and 242059 transitions. [2019-12-27 15:33:33,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:33:33,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 15:33:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:33,701 INFO L225 Difference]: With dead ends: 80712 [2019-12-27 15:33:33,702 INFO L226 Difference]: Without dead ends: 78001 [2019-12-27 15:33:33,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 16 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:33:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78001 states. [2019-12-27 15:33:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78001 to 23339. [2019-12-27 15:33:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23339 states. [2019-12-27 15:33:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23339 states to 23339 states and 70879 transitions. [2019-12-27 15:33:34,533 INFO L78 Accepts]: Start accepts. Automaton has 23339 states and 70879 transitions. Word has length 64 [2019-12-27 15:33:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:34,533 INFO L462 AbstractCegarLoop]: Abstraction has 23339 states and 70879 transitions. [2019-12-27 15:33:34,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:33:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 23339 states and 70879 transitions. [2019-12-27 15:33:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:33:34,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:34,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:34,557 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1711686189, now seen corresponding path program 4 times [2019-12-27 15:33:34,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:34,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966798545] [2019-12-27 15:33:34,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:34,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966798545] [2019-12-27 15:33:34,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:34,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:34,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [401302293] [2019-12-27 15:33:34,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:34,651 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:35,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 303 states and 577 transitions. [2019-12-27 15:33:35,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:35,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:33:35,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:33:35,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:35,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:33:35,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:35,005 INFO L87 Difference]: Start difference. First operand 23339 states and 70879 transitions. Second operand 3 states. [2019-12-27 15:33:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:35,180 INFO L93 Difference]: Finished difference Result 27355 states and 83042 transitions. [2019-12-27 15:33:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:33:35,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:33:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:35,231 INFO L225 Difference]: With dead ends: 27355 [2019-12-27 15:33:35,231 INFO L226 Difference]: Without dead ends: 27355 [2019-12-27 15:33:35,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:33:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27355 states. [2019-12-27 15:33:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27355 to 24236. [2019-12-27 15:33:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24236 states. [2019-12-27 15:33:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24236 states to 24236 states and 73842 transitions. [2019-12-27 15:33:35,710 INFO L78 Accepts]: Start accepts. Automaton has 24236 states and 73842 transitions. Word has length 64 [2019-12-27 15:33:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:35,711 INFO L462 AbstractCegarLoop]: Abstraction has 24236 states and 73842 transitions. [2019-12-27 15:33:35,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:33:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 24236 states and 73842 transitions. [2019-12-27 15:33:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:35,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:35,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:35,740 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash 904135165, now seen corresponding path program 1 times [2019-12-27 15:33:35,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:35,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461060451] [2019-12-27 15:33:35,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:35,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461060451] [2019-12-27 15:33:35,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:35,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:33:35,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [62282932] [2019-12-27 15:33:35,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:35,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:36,268 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 340 transitions. [2019-12-27 15:33:36,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:36,425 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 15:33:36,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:33:36,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:36,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:33:36,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:33:36,429 INFO L87 Difference]: Start difference. First operand 24236 states and 73842 transitions. Second operand 9 states. [2019-12-27 15:33:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:39,253 INFO L93 Difference]: Finished difference Result 97870 states and 296895 transitions. [2019-12-27 15:33:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 15:33:39,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 15:33:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:39,364 INFO L225 Difference]: With dead ends: 97870 [2019-12-27 15:33:39,364 INFO L226 Difference]: Without dead ends: 74532 [2019-12-27 15:33:39,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 15:33:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74532 states. [2019-12-27 15:33:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74532 to 26853. [2019-12-27 15:33:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26853 states. [2019-12-27 15:33:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26853 states to 26853 states and 82358 transitions. [2019-12-27 15:33:40,176 INFO L78 Accepts]: Start accepts. Automaton has 26853 states and 82358 transitions. Word has length 65 [2019-12-27 15:33:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:40,176 INFO L462 AbstractCegarLoop]: Abstraction has 26853 states and 82358 transitions. [2019-12-27 15:33:40,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:33:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 26853 states and 82358 transitions. [2019-12-27 15:33:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:40,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:40,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:40,207 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:40,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1662440961, now seen corresponding path program 2 times [2019-12-27 15:33:40,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:40,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363004752] [2019-12-27 15:33:40,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:40,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363004752] [2019-12-27 15:33:40,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:40,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:33:40,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811778266] [2019-12-27 15:33:40,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:40,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:40,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 292 transitions. [2019-12-27 15:33:40,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:40,479 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:33:40,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:40,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:40,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:40,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:40,480 INFO L87 Difference]: Start difference. First operand 26853 states and 82358 transitions. Second operand 4 states. [2019-12-27 15:33:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:40,857 INFO L93 Difference]: Finished difference Result 26580 states and 81377 transitions. [2019-12-27 15:33:40,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:33:40,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 15:33:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:40,893 INFO L225 Difference]: With dead ends: 26580 [2019-12-27 15:33:40,893 INFO L226 Difference]: Without dead ends: 26580 [2019-12-27 15:33:40,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-27 15:33:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26580 states. [2019-12-27 15:33:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26580 to 25683. [2019-12-27 15:33:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25683 states. [2019-12-27 15:33:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25683 states to 25683 states and 78414 transitions. [2019-12-27 15:33:41,296 INFO L78 Accepts]: Start accepts. Automaton has 25683 states and 78414 transitions. Word has length 65 [2019-12-27 15:33:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:41,297 INFO L462 AbstractCegarLoop]: Abstraction has 25683 states and 78414 transitions. [2019-12-27 15:33:41,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 25683 states and 78414 transitions. [2019-12-27 15:33:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:41,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:41,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:41,325 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:41,325 INFO L82 PathProgramCache]: Analyzing trace with hash 651721355, now seen corresponding path program 1 times [2019-12-27 15:33:41,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:41,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175024482] [2019-12-27 15:33:41,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:41,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175024482] [2019-12-27 15:33:41,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:41,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 15:33:41,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [355378810] [2019-12-27 15:33:41,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:41,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:41,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 306 states and 582 transitions. [2019-12-27 15:33:41,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:41,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 15:33:41,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:33:41,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:41,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:33:41,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:33:41,884 INFO L87 Difference]: Start difference. First operand 25683 states and 78414 transitions. Second operand 12 states. [2019-12-27 15:33:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:46,605 INFO L93 Difference]: Finished difference Result 78783 states and 235993 transitions. [2019-12-27 15:33:46,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 15:33:46,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 15:33:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:46,738 INFO L225 Difference]: With dead ends: 78783 [2019-12-27 15:33:46,738 INFO L226 Difference]: Without dead ends: 78475 [2019-12-27 15:33:46,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 43 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=527, Invalid=2665, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 15:33:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78475 states. [2019-12-27 15:33:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78475 to 32654. [2019-12-27 15:33:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32654 states. [2019-12-27 15:33:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32654 states to 32654 states and 99002 transitions. [2019-12-27 15:33:47,972 INFO L78 Accepts]: Start accepts. Automaton has 32654 states and 99002 transitions. Word has length 65 [2019-12-27 15:33:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:47,972 INFO L462 AbstractCegarLoop]: Abstraction has 32654 states and 99002 transitions. [2019-12-27 15:33:47,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:33:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 32654 states and 99002 transitions. [2019-12-27 15:33:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:48,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:48,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:48,007 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash -362903197, now seen corresponding path program 2 times [2019-12-27 15:33:48,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:48,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259005867] [2019-12-27 15:33:48,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:48,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259005867] [2019-12-27 15:33:48,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:48,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:33:48,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1829130767] [2019-12-27 15:33:48,100 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:48,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:48,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 306 states and 529 transitions. [2019-12-27 15:33:48,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:48,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:33:48,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:33:48,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:33:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:33:48,406 INFO L87 Difference]: Start difference. First operand 32654 states and 99002 transitions. Second operand 8 states. [2019-12-27 15:33:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:50,109 INFO L93 Difference]: Finished difference Result 53245 states and 158915 transitions. [2019-12-27 15:33:50,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:33:50,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 15:33:50,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:50,183 INFO L225 Difference]: With dead ends: 53245 [2019-12-27 15:33:50,183 INFO L226 Difference]: Without dead ends: 53001 [2019-12-27 15:33:50,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:33:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53001 states. [2019-12-27 15:33:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53001 to 37663. [2019-12-27 15:33:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37663 states. [2019-12-27 15:33:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37663 states to 37663 states and 113593 transitions. [2019-12-27 15:33:50,880 INFO L78 Accepts]: Start accepts. Automaton has 37663 states and 113593 transitions. Word has length 65 [2019-12-27 15:33:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:50,880 INFO L462 AbstractCegarLoop]: Abstraction has 37663 states and 113593 transitions. [2019-12-27 15:33:50,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:33:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 37663 states and 113593 transitions. [2019-12-27 15:33:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:33:51,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:51,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:51,165 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:51,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:51,165 INFO L82 PathProgramCache]: Analyzing trace with hash 727172643, now seen corresponding path program 3 times [2019-12-27 15:33:51,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:51,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210894377] [2019-12-27 15:33:51,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:51,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210894377] [2019-12-27 15:33:51,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:51,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:33:51,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1482570673] [2019-12-27 15:33:51,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:51,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:51,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 351 transitions. [2019-12-27 15:33:51,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:51,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:33:51,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:33:51,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:33:51,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:33:51,487 INFO L87 Difference]: Start difference. First operand 37663 states and 113593 transitions. Second operand 4 states. [2019-12-27 15:33:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:52,003 INFO L93 Difference]: Finished difference Result 41867 states and 123106 transitions. [2019-12-27 15:33:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:33:52,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 15:33:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:52,093 INFO L225 Difference]: With dead ends: 41867 [2019-12-27 15:33:52,093 INFO L226 Difference]: Without dead ends: 41867 [2019-12-27 15:33:52,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:33:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41867 states. [2019-12-27 15:33:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41867 to 29931. [2019-12-27 15:33:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29931 states. [2019-12-27 15:33:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29931 states to 29931 states and 88754 transitions. [2019-12-27 15:33:52,899 INFO L78 Accepts]: Start accepts. Automaton has 29931 states and 88754 transitions. Word has length 65 [2019-12-27 15:33:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:52,899 INFO L462 AbstractCegarLoop]: Abstraction has 29931 states and 88754 transitions. [2019-12-27 15:33:52,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:33:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 29931 states and 88754 transitions. [2019-12-27 15:33:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:52,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:52,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:52,930 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash -575221666, now seen corresponding path program 1 times [2019-12-27 15:33:52,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:52,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722420279] [2019-12-27 15:33:52,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:53,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722420279] [2019-12-27 15:33:53,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:53,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:33:53,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [208765792] [2019-12-27 15:33:53,109 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:53,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:53,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 526 transitions. [2019-12-27 15:33:53,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:53,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:33:53,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:33:53,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:53,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:33:53,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:33:53,366 INFO L87 Difference]: Start difference. First operand 29931 states and 88754 transitions. Second operand 11 states. [2019-12-27 15:33:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:54,871 INFO L93 Difference]: Finished difference Result 42710 states and 126019 transitions. [2019-12-27 15:33:54,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:33:54,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 15:33:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:54,920 INFO L225 Difference]: With dead ends: 42710 [2019-12-27 15:33:54,920 INFO L226 Difference]: Without dead ends: 35004 [2019-12-27 15:33:54,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:33:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35004 states. [2019-12-27 15:33:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35004 to 30387. [2019-12-27 15:33:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30387 states. [2019-12-27 15:33:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30387 states to 30387 states and 89960 transitions. [2019-12-27 15:33:55,805 INFO L78 Accepts]: Start accepts. Automaton has 30387 states and 89960 transitions. Word has length 66 [2019-12-27 15:33:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:55,806 INFO L462 AbstractCegarLoop]: Abstraction has 30387 states and 89960 transitions. [2019-12-27 15:33:55,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:33:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 30387 states and 89960 transitions. [2019-12-27 15:33:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:55,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:55,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:55,840 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1382447130, now seen corresponding path program 2 times [2019-12-27 15:33:55,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:55,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920279266] [2019-12-27 15:33:55,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:56,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920279266] [2019-12-27 15:33:56,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:56,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:33:56,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [368222156] [2019-12-27 15:33:56,032 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:56,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:56,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 360 states and 738 transitions. [2019-12-27 15:33:56,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:56,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:56,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 15:33:56,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:33:56,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:33:56,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:33:56,562 INFO L87 Difference]: Start difference. First operand 30387 states and 89960 transitions. Second operand 11 states. [2019-12-27 15:33:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:33:57,991 INFO L93 Difference]: Finished difference Result 43439 states and 127161 transitions. [2019-12-27 15:33:57,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 15:33:57,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 15:33:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:33:58,041 INFO L225 Difference]: With dead ends: 43439 [2019-12-27 15:33:58,042 INFO L226 Difference]: Without dead ends: 37494 [2019-12-27 15:33:58,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:33:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37494 states. [2019-12-27 15:33:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37494 to 30721. [2019-12-27 15:33:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30721 states. [2019-12-27 15:33:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30721 states to 30721 states and 90807 transitions. [2019-12-27 15:33:58,622 INFO L78 Accepts]: Start accepts. Automaton has 30721 states and 90807 transitions. Word has length 66 [2019-12-27 15:33:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:33:58,622 INFO L462 AbstractCegarLoop]: Abstraction has 30721 states and 90807 transitions. [2019-12-27 15:33:58,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:33:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 30721 states and 90807 transitions. [2019-12-27 15:33:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:33:58,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:33:58,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:33:58,661 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:33:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:33:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash -725843998, now seen corresponding path program 3 times [2019-12-27 15:33:58,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:33:58,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376221137] [2019-12-27 15:33:58,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:33:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:33:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:33:58,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376221137] [2019-12-27 15:33:58,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:33:58,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:33:58,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1914595676] [2019-12-27 15:33:58,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:33:58,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:33:59,244 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 316 states and 639 transitions. [2019-12-27 15:33:59,244 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:33:59,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:59,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:33:59,531 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:33:59,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 15:33:59,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:33:59,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 15:33:59,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:33:59,532 INFO L87 Difference]: Start difference. First operand 30721 states and 90807 transitions. Second operand 14 states. [2019-12-27 15:34:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:01,395 INFO L93 Difference]: Finished difference Result 41516 states and 121450 transitions. [2019-12-27 15:34:01,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:34:01,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 15:34:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:01,445 INFO L225 Difference]: With dead ends: 41516 [2019-12-27 15:34:01,446 INFO L226 Difference]: Without dead ends: 37123 [2019-12-27 15:34:01,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:34:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37123 states. [2019-12-27 15:34:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37123 to 30337. [2019-12-27 15:34:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30337 states. [2019-12-27 15:34:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30337 states to 30337 states and 89700 transitions. [2019-12-27 15:34:01,945 INFO L78 Accepts]: Start accepts. Automaton has 30337 states and 89700 transitions. Word has length 66 [2019-12-27 15:34:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:01,945 INFO L462 AbstractCegarLoop]: Abstraction has 30337 states and 89700 transitions. [2019-12-27 15:34:01,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 15:34:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 30337 states and 89700 transitions. [2019-12-27 15:34:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:34:01,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:01,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:34:01,973 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:34:01,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:01,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2096267966, now seen corresponding path program 4 times [2019-12-27 15:34:01,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:01,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951078237] [2019-12-27 15:34:01,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:34:02,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951078237] [2019-12-27 15:34:02,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:02,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 15:34:02,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [657869268] [2019-12-27 15:34:02,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:02,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:02,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 311 states and 634 transitions. [2019-12-27 15:34:02,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:03,041 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-12-27 15:34:03,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 15:34:03,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 15:34:03,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 15:34:03,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:03,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 15:34:03,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:34:03,241 INFO L87 Difference]: Start difference. First operand 30337 states and 89700 transitions. Second operand 18 states. [2019-12-27 15:34:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:34:10,875 INFO L93 Difference]: Finished difference Result 81101 states and 237322 transitions. [2019-12-27 15:34:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 15:34:10,876 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 15:34:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:34:10,985 INFO L225 Difference]: With dead ends: 81101 [2019-12-27 15:34:10,985 INFO L226 Difference]: Without dead ends: 80861 [2019-12-27 15:34:10,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=618, Invalid=3672, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 15:34:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80861 states. [2019-12-27 15:34:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80861 to 34173. [2019-12-27 15:34:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34173 states. [2019-12-27 15:34:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34173 states to 34173 states and 101780 transitions. [2019-12-27 15:34:11,884 INFO L78 Accepts]: Start accepts. Automaton has 34173 states and 101780 transitions. Word has length 66 [2019-12-27 15:34:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:34:11,884 INFO L462 AbstractCegarLoop]: Abstraction has 34173 states and 101780 transitions. [2019-12-27 15:34:11,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 15:34:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 34173 states and 101780 transitions. [2019-12-27 15:34:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:34:11,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:34:11,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:34:11,926 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:34:11,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:34:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1649931674, now seen corresponding path program 5 times [2019-12-27 15:34:11,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:34:11,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473676874] [2019-12-27 15:34:11,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:34:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:34:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:34:12,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473676874] [2019-12-27 15:34:12,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:34:12,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 15:34:12,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [155723438] [2019-12-27 15:34:12,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:34:12,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:34:12,742 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 370 transitions. [2019-12-27 15:34:12,742 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:34:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:34:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:34:13,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 15:34:13,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 15:34:13,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:34:13,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 15:34:13,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:34:13,186 INFO L87 Difference]: Start difference. First operand 34173 states and 101780 transitions. Second operand 28 states. [2019-12-27 15:34:31,235 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2019-12-27 15:34:45,415 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-12-27 15:35:28,104 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2019-12-27 15:35:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:35:34,437 INFO L93 Difference]: Finished difference Result 228454 states and 683163 transitions. [2019-12-27 15:35:34,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 679 states. [2019-12-27 15:35:34,437 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2019-12-27 15:35:34,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:35:34,735 INFO L225 Difference]: With dead ends: 228454 [2019-12-27 15:35:34,735 INFO L226 Difference]: Without dead ends: 201723 [2019-12-27 15:35:34,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 31 SyntacticMatches, 14 SemanticMatches, 687 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223195 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=30304, Invalid=443728, Unknown=0, NotChecked=0, Total=474032 [2019-12-27 15:35:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201723 states. [2019-12-27 15:35:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201723 to 41966. [2019-12-27 15:35:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41966 states. [2019-12-27 15:35:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41966 states to 41966 states and 125777 transitions. [2019-12-27 15:35:37,270 INFO L78 Accepts]: Start accepts. Automaton has 41966 states and 125777 transitions. Word has length 66 [2019-12-27 15:35:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:35:37,270 INFO L462 AbstractCegarLoop]: Abstraction has 41966 states and 125777 transitions. [2019-12-27 15:35:37,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 15:35:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 41966 states and 125777 transitions. [2019-12-27 15:35:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:35:37,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:35:37,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:35:37,311 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:35:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:35:37,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1417820142, now seen corresponding path program 6 times [2019-12-27 15:35:37,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:35:37,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567876073] [2019-12-27 15:35:37,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:35:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:35:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:35:37,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567876073] [2019-12-27 15:35:37,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:35:37,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:35:37,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825595670] [2019-12-27 15:35:37,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:35:37,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:35:37,818 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 441 transitions. [2019-12-27 15:35:37,818 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:35:37,963 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 15:35:37,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:35:37,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:35:37,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:35:37,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:35:37,964 INFO L87 Difference]: Start difference. First operand 41966 states and 125777 transitions. Second operand 13 states. [2019-12-27 15:35:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:35:43,291 INFO L93 Difference]: Finished difference Result 163671 states and 488816 transitions. [2019-12-27 15:35:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-27 15:35:43,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 15:35:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:35:43,510 INFO L225 Difference]: With dead ends: 163671 [2019-12-27 15:35:43,510 INFO L226 Difference]: Without dead ends: 136307 [2019-12-27 15:35:43,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=905, Invalid=5101, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 15:35:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136307 states. [2019-12-27 15:35:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136307 to 48431. [2019-12-27 15:35:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48431 states. [2019-12-27 15:35:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48431 states to 48431 states and 145255 transitions. [2019-12-27 15:35:45,411 INFO L78 Accepts]: Start accepts. Automaton has 48431 states and 145255 transitions. Word has length 66 [2019-12-27 15:35:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:35:45,411 INFO L462 AbstractCegarLoop]: Abstraction has 48431 states and 145255 transitions. [2019-12-27 15:35:45,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:35:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 48431 states and 145255 transitions. [2019-12-27 15:35:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:35:45,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:35:45,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:35:45,461 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:35:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:35:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1951402002, now seen corresponding path program 7 times [2019-12-27 15:35:45,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:35:45,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592521856] [2019-12-27 15:35:45,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:35:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:35:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:35:45,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592521856] [2019-12-27 15:35:45,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:35:45,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 15:35:45,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [456730516] [2019-12-27 15:35:45,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:35:45,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:35:46,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 278 states and 543 transitions. [2019-12-27 15:35:46,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:35:46,754 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-27 15:35:47,394 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2019-12-27 15:35:47,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms Received shutdown request... [2019-12-27 15:35:47,570 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 15:35:47,577 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 15:35:47,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:35:47 BasicIcfg [2019-12-27 15:35:47,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:35:47,583 INFO L168 Benchmark]: Toolchain (without parser) took 224915.23 ms. Allocated memory was 140.5 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.6 MB in the beginning and 819.9 MB in the end (delta: -718.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 15:35:47,584 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 140.5 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 15:35:47,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.40 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 157.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:47,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.88 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:47,585 INFO L168 Benchmark]: Boogie Preprocessor took 48.79 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:47,585 INFO L168 Benchmark]: RCFGBuilder took 820.54 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 101.7 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 15:35:47,589 INFO L168 Benchmark]: TraceAbstraction took 223183.28 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.1 MB in the beginning and 819.9 MB in the end (delta: -718.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 15:35:47,591 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.17 ms. Allocated memory is still 140.5 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.40 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 157.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.88 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.79 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.54 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 101.7 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223183.28 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.1 MB in the beginning and 819.9 MB in the end (delta: -718.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 1,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 1,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: TIMEOUT, OverallTime: 222.9s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 140.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9548 SDtfs, 17197 SDslu, 44051 SDs, 0 SdLazy, 58095 SolverSat, 1700 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1492 GetRequests, 263 SyntacticMatches, 82 SemanticMatches, 1147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228370 ImplicationChecksByTransitivity, 55.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 654983 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1349 NumberOfCodeBlocks, 1349 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1318 ConstructedInterpolants, 0 QuantifiedInterpolants, 288030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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 could not prove your program: Timeout Completed graceful shutdown