/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:11:05,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:11:05,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:11:05,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:11:05,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:11:05,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:11:05,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:11:05,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:11:05,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:11:05,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:11:05,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:11:05,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:11:05,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:11:05,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:11:05,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:11:05,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:11:05,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:11:05,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:11:05,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:11:05,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:11:05,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:11:05,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:11:05,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:11:05,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:11:05,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:11:05,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:11:05,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:11:05,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:11:05,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:11:05,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:11:05,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:11:05,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:11:05,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:11:05,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:11:05,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:11:05,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:11:05,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:11:05,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:11:05,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:11:05,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:11:05,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:11:05,394 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:11:05,414 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:11:05,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:11:05,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:11:05,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:11:05,416 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:11:05,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:11:05,416 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:11:05,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:11:05,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:11:05,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:11:05,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:11:05,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:11:05,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:11:05,418 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:11:05,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:11:05,418 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:11:05,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:11:05,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:11:05,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:11:05,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:11:05,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:11:05,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:11:05,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:11:05,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:11:05,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:11:05,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:11:05,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:11:05,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:11:05,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:11:05,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:11:05,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:11:05,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:11:05,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:11:05,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:11:05,723 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:11:05,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-26 23:11:05,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0458ad4a5/30c9e6f6f1ae43c0ae1beaeb3d3f52ac/FLAGac0dc2db3 [2019-12-26 23:11:06,328 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:11:06,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-26 23:11:06,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0458ad4a5/30c9e6f6f1ae43c0ae1beaeb3d3f52ac/FLAGac0dc2db3 [2019-12-26 23:11:06,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0458ad4a5/30c9e6f6f1ae43c0ae1beaeb3d3f52ac [2019-12-26 23:11:06,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:11:06,655 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:11:06,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:11:06,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:11:06,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:11:06,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:11:06" (1/1) ... [2019-12-26 23:11:06,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36036b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:06, skipping insertion in model container [2019-12-26 23:11:06,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:11:06" (1/1) ... [2019-12-26 23:11:06,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:11:06,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:11:07,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:11:07,314 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:11:07,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:11:07,484 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:11:07,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07 WrapperNode [2019-12-26 23:11:07,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:11:07,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:11:07,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:11:07,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:11:07,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (1/1) ... [2019-12-26 23:11:07,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (1/1) ... [2019-12-26 23:11:07,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:11:07,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:11:07,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:11:07,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:11:07,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (1/1) ... [2019-12-26 23:11:07,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (1/1) ... [2019-12-26 23:11:07,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (1/1) ... [2019-12-26 23:11:07,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (1/1) ... [2019-12-26 23:11:07,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (1/1) ... [2019-12-26 23:11:07,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (1/1) ... [2019-12-26 23:11:07,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (1/1) ... [2019-12-26 23:11:07,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:11:07,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:11:07,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:11:07,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:11:07,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (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-26 23:11:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:11:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:11:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:11:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:11:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:11:07,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:11:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:11:07,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:11:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:11:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:11:07,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:11:07,717 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:11:08,989 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:11:08,989 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:11:08,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:11:08 BoogieIcfgContainer [2019-12-26 23:11:08,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:11:08,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:11:08,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:11:08,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:11:08,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:11:06" (1/3) ... [2019-12-26 23:11:08,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb70017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:11:08, skipping insertion in model container [2019-12-26 23:11:08,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:07" (2/3) ... [2019-12-26 23:11:09,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb70017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:11:08, skipping insertion in model container [2019-12-26 23:11:09,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:11:08" (3/3) ... [2019-12-26 23:11:09,003 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.opt.i [2019-12-26 23:11:09,014 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:11:09,015 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:11:09,026 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:11:09,027 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:11:09,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,178 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,181 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,192 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,196 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:09,212 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:11:09,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:11:09,234 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:11:09,234 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:11:09,234 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:11:09,234 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:11:09,234 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:11:09,235 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:11:09,235 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:11:09,259 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-26 23:11:09,261 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:11:09,483 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:11:09,484 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:11:09,534 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:11:09,638 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:11:09,784 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:11:09,784 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:11:09,808 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:11:09,860 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-26 23:11:09,861 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:11:17,844 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:11:17,951 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:11:18,082 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-26 23:11:18,082 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-26 23:11:18,085 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-26 23:11:32,574 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-26 23:11:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-26 23:11:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:11:32,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:32,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:11:32,584 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:32,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-26 23:11:32,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:32,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971235185] [2019-12-26 23:11:32,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:32,838 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-26 23:11:32,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971235185] [2019-12-26 23:11:32,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:32,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:11:32,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127345260] [2019-12-26 23:11:32,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:32,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:32,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:32,860 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-26 23:11:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:36,848 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-26 23:11:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:36,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:11:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:37,636 INFO L225 Difference]: With dead ends: 116456 [2019-12-26 23:11:37,636 INFO L226 Difference]: Without dead ends: 114036 [2019-12-26 23:11:37,638 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-26 23:11:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-26 23:11:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-26 23:11:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-26 23:11:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-26 23:11:48,110 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-26 23:11:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:48,110 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-26 23:11:48,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-26 23:11:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:11:48,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:48,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:48,113 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-26 23:11:48,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:48,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256926382] [2019-12-26 23:11:48,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:48,205 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-26 23:11:48,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256926382] [2019-12-26 23:11:48,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:48,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:48,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960332778] [2019-12-26 23:11:48,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:48,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:48,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:48,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:48,209 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-26 23:11:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:49,344 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-26 23:11:49,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:11:49,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:11:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:54,666 INFO L225 Difference]: With dead ends: 152998 [2019-12-26 23:11:54,666 INFO L226 Difference]: Without dead ends: 152998 [2019-12-26 23:11:54,667 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-26 23:12:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-26 23:12:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-26 23:12:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-26 23:12:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-26 23:12:03,416 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-26 23:12:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:03,417 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-26 23:12:03,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:12:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-26 23:12:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:12:03,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:03,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:12:03,420 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-26 23:12:03,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:03,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200381616] [2019-12-26 23:12:03,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:03,533 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-26 23:12:03,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200381616] [2019-12-26 23:12:03,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:03,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:12:03,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48690368] [2019-12-26 23:12:03,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:12:03,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:12:03,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:12:03,537 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-26 23:12:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:03,616 INFO L93 Difference]: Finished difference Result 11993 states and 33125 transitions. [2019-12-26 23:12:03,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:12:03,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:12:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:03,627 INFO L225 Difference]: With dead ends: 11993 [2019-12-26 23:12:03,628 INFO L226 Difference]: Without dead ends: 8737 [2019-12-26 23:12:03,628 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-26 23:12:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2019-12-26 23:12:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8729. [2019-12-26 23:12:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8729 states. [2019-12-26 23:12:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 21886 transitions. [2019-12-26 23:12:03,788 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 21886 transitions. Word has length 11 [2019-12-26 23:12:03,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:03,788 INFO L462 AbstractCegarLoop]: Abstraction has 8729 states and 21886 transitions. [2019-12-26 23:12:03,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:12:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 21886 transitions. [2019-12-26 23:12:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:12:03,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:03,794 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-26 23:12:03,794 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-26 23:12:03,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:03,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269841508] [2019-12-26 23:12:03,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:04,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-26 23:12:04,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269841508] [2019-12-26 23:12:04,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:04,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:12:04,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881903694] [2019-12-26 23:12:04,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:04,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:04,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:04,041 INFO L87 Difference]: Start difference. First operand 8729 states and 21886 transitions. Second operand 6 states. [2019-12-26 23:12:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:05,039 INFO L93 Difference]: Finished difference Result 10286 states and 25434 transitions. [2019-12-26 23:12:05,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:12:05,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 23:12:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:05,051 INFO L225 Difference]: With dead ends: 10286 [2019-12-26 23:12:05,052 INFO L226 Difference]: Without dead ends: 10286 [2019-12-26 23:12:05,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:12:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-26 23:12:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10191. [2019-12-26 23:12:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2019-12-26 23:12:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 25249 transitions. [2019-12-26 23:12:05,207 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 25249 transitions. Word has length 25 [2019-12-26 23:12:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:05,208 INFO L462 AbstractCegarLoop]: Abstraction has 10191 states and 25249 transitions. [2019-12-26 23:12:05,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 25249 transitions. [2019-12-26 23:12:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-26 23:12:05,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:05,216 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] [2019-12-26 23:12:05,216 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:05,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-26 23:12:05,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:05,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804132810] [2019-12-26 23:12:05,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:05,344 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-26 23:12:05,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804132810] [2019-12-26 23:12:05,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:05,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:12:05,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500779460] [2019-12-26 23:12:05,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:05,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:05,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:05,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:05,346 INFO L87 Difference]: Start difference. First operand 10191 states and 25249 transitions. Second operand 6 states. [2019-12-26 23:12:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:06,496 INFO L93 Difference]: Finished difference Result 11186 states and 27316 transitions. [2019-12-26 23:12:06,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:12:06,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-26 23:12:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:06,512 INFO L225 Difference]: With dead ends: 11186 [2019-12-26 23:12:06,512 INFO L226 Difference]: Without dead ends: 11138 [2019-12-26 23:12:06,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-26 23:12:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10951. [2019-12-26 23:12:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-26 23:12:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26866 transitions. [2019-12-26 23:12:06,699 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26866 transitions. Word has length 38 [2019-12-26 23:12:06,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:06,699 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26866 transitions. [2019-12-26 23:12:06,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26866 transitions. [2019-12-26 23:12:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 23:12:06,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:06,711 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] [2019-12-26 23:12:06,712 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-26 23:12:06,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:06,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323854166] [2019-12-26 23:12:06,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:06,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-26 23:12:06,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323854166] [2019-12-26 23:12:06,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:06,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:12:06,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115038255] [2019-12-26 23:12:06,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:12:06,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:12:06,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:12:06,820 INFO L87 Difference]: Start difference. First operand 10951 states and 26866 transitions. Second operand 5 states. [2019-12-26 23:12:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:06,875 INFO L93 Difference]: Finished difference Result 4762 states and 11299 transitions. [2019-12-26 23:12:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:12:06,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-26 23:12:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:06,883 INFO L225 Difference]: With dead ends: 4762 [2019-12-26 23:12:06,883 INFO L226 Difference]: Without dead ends: 4575 [2019-12-26 23:12:06,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-12-26 23:12:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4507. [2019-12-26 23:12:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2019-12-26 23:12:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 10763 transitions. [2019-12-26 23:12:06,964 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 10763 transitions. Word has length 50 [2019-12-26 23:12:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:06,965 INFO L462 AbstractCegarLoop]: Abstraction has 4507 states and 10763 transitions. [2019-12-26 23:12:06,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:12:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 10763 transitions. [2019-12-26 23:12:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:06,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:06,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:06,976 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:06,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:06,976 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-26 23:12:06,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:06,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239089093] [2019-12-26 23:12:06,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:07,106 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-26 23:12:07,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239089093] [2019-12-26 23:12:07,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:07,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:12:07,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383365744] [2019-12-26 23:12:07,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:07,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:07,108 INFO L87 Difference]: Start difference. First operand 4507 states and 10763 transitions. Second operand 6 states. [2019-12-26 23:12:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:07,996 INFO L93 Difference]: Finished difference Result 6100 states and 14382 transitions. [2019-12-26 23:12:07,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:12:07,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:12:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:08,005 INFO L225 Difference]: With dead ends: 6100 [2019-12-26 23:12:08,005 INFO L226 Difference]: Without dead ends: 6100 [2019-12-26 23:12:08,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2019-12-26 23:12:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 5765. [2019-12-26 23:12:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-12-26 23:12:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 13657 transitions. [2019-12-26 23:12:08,100 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 13657 transitions. Word has length 94 [2019-12-26 23:12:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:08,100 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 13657 transitions. [2019-12-26 23:12:08,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 13657 transitions. [2019-12-26 23:12:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:08,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:08,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:08,115 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:08,116 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-26 23:12:08,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:08,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790836379] [2019-12-26 23:12:08,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:08,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790836379] [2019-12-26 23:12:08,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:08,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:08,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903841715] [2019-12-26 23:12:08,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:08,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:08,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:08,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:08,273 INFO L87 Difference]: Start difference. First operand 5765 states and 13657 transitions. Second operand 7 states. [2019-12-26 23:12:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:09,324 INFO L93 Difference]: Finished difference Result 6939 states and 16285 transitions. [2019-12-26 23:12:09,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:12:09,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:12:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:09,333 INFO L225 Difference]: With dead ends: 6939 [2019-12-26 23:12:09,333 INFO L226 Difference]: Without dead ends: 6939 [2019-12-26 23:12:09,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:12:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6939 states. [2019-12-26 23:12:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6939 to 6214. [2019-12-26 23:12:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2019-12-26 23:12:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 14677 transitions. [2019-12-26 23:12:09,435 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 14677 transitions. Word has length 94 [2019-12-26 23:12:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:09,435 INFO L462 AbstractCegarLoop]: Abstraction has 6214 states and 14677 transitions. [2019-12-26 23:12:09,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 14677 transitions. [2019-12-26 23:12:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:09,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:09,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:09,447 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:09,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:09,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-26 23:12:09,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:09,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672741392] [2019-12-26 23:12:09,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:09,559 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-26 23:12:09,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672741392] [2019-12-26 23:12:09,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:09,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:12:09,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453750131] [2019-12-26 23:12:09,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:12:09,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:09,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:12:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:12:09,562 INFO L87 Difference]: Start difference. First operand 6214 states and 14677 transitions. Second operand 5 states. [2019-12-26 23:12:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:10,182 INFO L93 Difference]: Finished difference Result 6709 states and 15705 transitions. [2019-12-26 23:12:10,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:12:10,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-26 23:12:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:10,196 INFO L225 Difference]: With dead ends: 6709 [2019-12-26 23:12:10,196 INFO L226 Difference]: Without dead ends: 6709 [2019-12-26 23:12:10,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-12-26 23:12:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 6274. [2019-12-26 23:12:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6274 states. [2019-12-26 23:12:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6274 states to 6274 states and 14825 transitions. [2019-12-26 23:12:10,341 INFO L78 Accepts]: Start accepts. Automaton has 6274 states and 14825 transitions. Word has length 94 [2019-12-26 23:12:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:10,342 INFO L462 AbstractCegarLoop]: Abstraction has 6274 states and 14825 transitions. [2019-12-26 23:12:10,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:12:10,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6274 states and 14825 transitions. [2019-12-26 23:12:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:10,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:10,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:10,356 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-26 23:12:10,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:10,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985117766] [2019-12-26 23:12:10,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:10,561 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-26 23:12:10,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985117766] [2019-12-26 23:12:10,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:10,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:12:10,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004307970] [2019-12-26 23:12:10,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:10,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:10,563 INFO L87 Difference]: Start difference. First operand 6274 states and 14825 transitions. Second operand 6 states. [2019-12-26 23:12:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:11,267 INFO L93 Difference]: Finished difference Result 6942 states and 16188 transitions. [2019-12-26 23:12:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:12:11,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:12:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:11,277 INFO L225 Difference]: With dead ends: 6942 [2019-12-26 23:12:11,277 INFO L226 Difference]: Without dead ends: 6942 [2019-12-26 23:12:11,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:12:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6942 states. [2019-12-26 23:12:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6942 to 6667. [2019-12-26 23:12:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6667 states. [2019-12-26 23:12:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6667 states to 6667 states and 15654 transitions. [2019-12-26 23:12:11,359 INFO L78 Accepts]: Start accepts. Automaton has 6667 states and 15654 transitions. Word has length 94 [2019-12-26 23:12:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:11,359 INFO L462 AbstractCegarLoop]: Abstraction has 6667 states and 15654 transitions. [2019-12-26 23:12:11,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 15654 transitions. [2019-12-26 23:12:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:11,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:11,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:11,368 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:11,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:11,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-26 23:12:11,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:11,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277633823] [2019-12-26 23:12:11,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:11,552 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-26 23:12:11,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277633823] [2019-12-26 23:12:11,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:11,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:12:11,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121456655] [2019-12-26 23:12:11,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:12:11,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:12:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:11,555 INFO L87 Difference]: Start difference. First operand 6667 states and 15654 transitions. Second operand 9 states. [2019-12-26 23:12:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:12,501 INFO L93 Difference]: Finished difference Result 11708 states and 27305 transitions. [2019-12-26 23:12:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:12:12,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-26 23:12:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:12,515 INFO L225 Difference]: With dead ends: 11708 [2019-12-26 23:12:12,515 INFO L226 Difference]: Without dead ends: 9503 [2019-12-26 23:12:12,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:12:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9503 states. [2019-12-26 23:12:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9503 to 7974. [2019-12-26 23:12:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-26 23:12:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 18887 transitions. [2019-12-26 23:12:12,609 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 18887 transitions. Word has length 94 [2019-12-26 23:12:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:12,609 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 18887 transitions. [2019-12-26 23:12:12,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:12:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 18887 transitions. [2019-12-26 23:12:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:12,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:12,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:12,619 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:12,620 INFO L82 PathProgramCache]: Analyzing trace with hash 644265771, now seen corresponding path program 6 times [2019-12-26 23:12:12,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:12,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682627338] [2019-12-26 23:12:12,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:12,722 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-26 23:12:12,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682627338] [2019-12-26 23:12:12,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:12,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:12:12,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922466333] [2019-12-26 23:12:12,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:12,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:12,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:12,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:12,724 INFO L87 Difference]: Start difference. First operand 7974 states and 18887 transitions. Second operand 6 states. [2019-12-26 23:12:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:13,332 INFO L93 Difference]: Finished difference Result 8475 states and 19884 transitions. [2019-12-26 23:12:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:12:13,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:12:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:13,345 INFO L225 Difference]: With dead ends: 8475 [2019-12-26 23:12:13,345 INFO L226 Difference]: Without dead ends: 8475 [2019-12-26 23:12:13,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:12:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8475 states. [2019-12-26 23:12:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8475 to 8139. [2019-12-26 23:12:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8139 states. [2019-12-26 23:12:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8139 states to 8139 states and 19236 transitions. [2019-12-26 23:12:13,487 INFO L78 Accepts]: Start accepts. Automaton has 8139 states and 19236 transitions. Word has length 94 [2019-12-26 23:12:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:13,487 INFO L462 AbstractCegarLoop]: Abstraction has 8139 states and 19236 transitions. [2019-12-26 23:12:13,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8139 states and 19236 transitions. [2019-12-26 23:12:13,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:13,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:13,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:13,503 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:13,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:13,503 INFO L82 PathProgramCache]: Analyzing trace with hash 12884261, now seen corresponding path program 7 times [2019-12-26 23:12:13,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:13,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178075162] [2019-12-26 23:12:13,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:13,611 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-26 23:12:13,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178075162] [2019-12-26 23:12:13,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:13,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:12:13,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397595471] [2019-12-26 23:12:13,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:13,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:13,613 INFO L87 Difference]: Start difference. First operand 8139 states and 19236 transitions. Second operand 6 states. [2019-12-26 23:12:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:14,567 INFO L93 Difference]: Finished difference Result 13859 states and 32149 transitions. [2019-12-26 23:12:14,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:12:14,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:12:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:14,590 INFO L225 Difference]: With dead ends: 13859 [2019-12-26 23:12:14,590 INFO L226 Difference]: Without dead ends: 13859 [2019-12-26 23:12:14,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13859 states. [2019-12-26 23:12:14,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13859 to 10945. [2019-12-26 23:12:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10945 states. [2019-12-26 23:12:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10945 states to 10945 states and 26151 transitions. [2019-12-26 23:12:14,894 INFO L78 Accepts]: Start accepts. Automaton has 10945 states and 26151 transitions. Word has length 94 [2019-12-26 23:12:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:14,894 INFO L462 AbstractCegarLoop]: Abstraction has 10945 states and 26151 transitions. [2019-12-26 23:12:14,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 10945 states and 26151 transitions. [2019-12-26 23:12:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:14,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:14,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:14,917 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:14,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash -734364891, now seen corresponding path program 8 times [2019-12-26 23:12:14,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:14,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407373404] [2019-12-26 23:12:14,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:15,112 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-26 23:12:15,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407373404] [2019-12-26 23:12:15,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:15,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:12:15,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288902881] [2019-12-26 23:12:15,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:12:15,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:15,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:12:15,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:15,114 INFO L87 Difference]: Start difference. First operand 10945 states and 26151 transitions. Second operand 10 states. [2019-12-26 23:12:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:16,195 INFO L93 Difference]: Finished difference Result 18055 states and 42919 transitions. [2019-12-26 23:12:16,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:12:16,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-12-26 23:12:16,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:16,216 INFO L225 Difference]: With dead ends: 18055 [2019-12-26 23:12:16,216 INFO L226 Difference]: Without dead ends: 15870 [2019-12-26 23:12:16,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:12:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15870 states. [2019-12-26 23:12:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15870 to 11137. [2019-12-26 23:12:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11137 states. [2019-12-26 23:12:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11137 states to 11137 states and 26617 transitions. [2019-12-26 23:12:16,369 INFO L78 Accepts]: Start accepts. Automaton has 11137 states and 26617 transitions. Word has length 94 [2019-12-26 23:12:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:16,370 INFO L462 AbstractCegarLoop]: Abstraction has 11137 states and 26617 transitions. [2019-12-26 23:12:16,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:12:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 11137 states and 26617 transitions. [2019-12-26 23:12:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:16,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:16,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:16,385 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1526897605, now seen corresponding path program 9 times [2019-12-26 23:12:16,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:16,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074988447] [2019-12-26 23:12:16,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:16,496 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-26 23:12:16,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074988447] [2019-12-26 23:12:16,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:16,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:16,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780205559] [2019-12-26 23:12:16,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:16,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:16,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:16,498 INFO L87 Difference]: Start difference. First operand 11137 states and 26617 transitions. Second operand 7 states. [2019-12-26 23:12:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:17,339 INFO L93 Difference]: Finished difference Result 27194 states and 64653 transitions. [2019-12-26 23:12:17,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:12:17,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:12:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:17,369 INFO L225 Difference]: With dead ends: 27194 [2019-12-26 23:12:17,369 INFO L226 Difference]: Without dead ends: 27194 [2019-12-26 23:12:17,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:12:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27194 states. [2019-12-26 23:12:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27194 to 11187. [2019-12-26 23:12:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11187 states. [2019-12-26 23:12:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11187 states to 11187 states and 26735 transitions. [2019-12-26 23:12:17,746 INFO L78 Accepts]: Start accepts. Automaton has 11187 states and 26735 transitions. Word has length 94 [2019-12-26 23:12:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:17,746 INFO L462 AbstractCegarLoop]: Abstraction has 11187 states and 26735 transitions. [2019-12-26 23:12:17,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11187 states and 26735 transitions. [2019-12-26 23:12:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:17,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:17,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:17,760 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2107903975, now seen corresponding path program 10 times [2019-12-26 23:12:17,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:17,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719852148] [2019-12-26 23:12:17,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:17,841 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-26 23:12:17,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719852148] [2019-12-26 23:12:17,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:17,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:12:17,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719991779] [2019-12-26 23:12:17,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:12:17,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:17,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:12:17,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:12:17,843 INFO L87 Difference]: Start difference. First operand 11187 states and 26735 transitions. Second operand 3 states. [2019-12-26 23:12:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:17,909 INFO L93 Difference]: Finished difference Result 11187 states and 26734 transitions. [2019-12-26 23:12:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:12:17,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-26 23:12:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:17,921 INFO L225 Difference]: With dead ends: 11187 [2019-12-26 23:12:17,921 INFO L226 Difference]: Without dead ends: 11187 [2019-12-26 23:12:17,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:12:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11187 states. [2019-12-26 23:12:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11187 to 10277. [2019-12-26 23:12:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10277 states. [2019-12-26 23:12:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10277 states to 10277 states and 24820 transitions. [2019-12-26 23:12:18,039 INFO L78 Accepts]: Start accepts. Automaton has 10277 states and 24820 transitions. Word has length 94 [2019-12-26 23:12:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:18,039 INFO L462 AbstractCegarLoop]: Abstraction has 10277 states and 24820 transitions. [2019-12-26 23:12:18,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:12:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 10277 states and 24820 transitions. [2019-12-26 23:12:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:18,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:18,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:18,050 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:18,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1595101307, now seen corresponding path program 1 times [2019-12-26 23:12:18,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:18,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448462139] [2019-12-26 23:12:18,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:18,215 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-26 23:12:18,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448462139] [2019-12-26 23:12:18,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:18,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:12:18,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707449041] [2019-12-26 23:12:18,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:12:18,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:18,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:12:18,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:18,217 INFO L87 Difference]: Start difference. First operand 10277 states and 24820 transitions. Second operand 10 states. [2019-12-26 23:12:19,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:19,212 INFO L93 Difference]: Finished difference Result 14605 states and 34745 transitions. [2019-12-26 23:12:19,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:12:19,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-26 23:12:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:19,226 INFO L225 Difference]: With dead ends: 14605 [2019-12-26 23:12:19,226 INFO L226 Difference]: Without dead ends: 11131 [2019-12-26 23:12:19,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:12:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11131 states. [2019-12-26 23:12:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11131 to 9362. [2019-12-26 23:12:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9362 states. [2019-12-26 23:12:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9362 states to 9362 states and 22337 transitions. [2019-12-26 23:12:19,342 INFO L78 Accepts]: Start accepts. Automaton has 9362 states and 22337 transitions. Word has length 95 [2019-12-26 23:12:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:19,342 INFO L462 AbstractCegarLoop]: Abstraction has 9362 states and 22337 transitions. [2019-12-26 23:12:19,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:12:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9362 states and 22337 transitions. [2019-12-26 23:12:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:19,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:19,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:19,354 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 409927027, now seen corresponding path program 2 times [2019-12-26 23:12:19,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:19,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62865368] [2019-12-26 23:12:19,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:19,439 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-26 23:12:19,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62865368] [2019-12-26 23:12:19,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:19,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:12:19,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848978737] [2019-12-26 23:12:19,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:19,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:19,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:19,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:19,441 INFO L87 Difference]: Start difference. First operand 9362 states and 22337 transitions. Second operand 6 states. [2019-12-26 23:12:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:20,132 INFO L93 Difference]: Finished difference Result 10022 states and 23681 transitions. [2019-12-26 23:12:20,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:12:20,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-26 23:12:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:20,145 INFO L225 Difference]: With dead ends: 10022 [2019-12-26 23:12:20,145 INFO L226 Difference]: Without dead ends: 10022 [2019-12-26 23:12:20,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:12:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10022 states. [2019-12-26 23:12:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10022 to 9466. [2019-12-26 23:12:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9466 states. [2019-12-26 23:12:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9466 states to 9466 states and 22565 transitions. [2019-12-26 23:12:20,257 INFO L78 Accepts]: Start accepts. Automaton has 9466 states and 22565 transitions. Word has length 95 [2019-12-26 23:12:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:20,257 INFO L462 AbstractCegarLoop]: Abstraction has 9466 states and 22565 transitions. [2019-12-26 23:12:20,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 9466 states and 22565 transitions. [2019-12-26 23:12:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:20,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:20,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:20,270 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:20,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1173487395, now seen corresponding path program 3 times [2019-12-26 23:12:20,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:20,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664232129] [2019-12-26 23:12:20,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:20,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-26 23:12:20,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664232129] [2019-12-26 23:12:20,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:20,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:20,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911023354] [2019-12-26 23:12:20,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:20,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:20,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:20,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:20,375 INFO L87 Difference]: Start difference. First operand 9466 states and 22565 transitions. Second operand 7 states. [2019-12-26 23:12:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:21,277 INFO L93 Difference]: Finished difference Result 14356 states and 34319 transitions. [2019-12-26 23:12:21,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:12:21,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-26 23:12:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:21,295 INFO L225 Difference]: With dead ends: 14356 [2019-12-26 23:12:21,295 INFO L226 Difference]: Without dead ends: 14157 [2019-12-26 23:12:21,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:12:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2019-12-26 23:12:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 10402. [2019-12-26 23:12:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10402 states. [2019-12-26 23:12:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10402 states to 10402 states and 24654 transitions. [2019-12-26 23:12:21,435 INFO L78 Accepts]: Start accepts. Automaton has 10402 states and 24654 transitions. Word has length 95 [2019-12-26 23:12:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:21,436 INFO L462 AbstractCegarLoop]: Abstraction has 10402 states and 24654 transitions. [2019-12-26 23:12:21,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 10402 states and 24654 transitions. [2019-12-26 23:12:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:21,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:21,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:21,446 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:21,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash -536597709, now seen corresponding path program 4 times [2019-12-26 23:12:21,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:21,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463193696] [2019-12-26 23:12:21,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:21,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463193696] [2019-12-26 23:12:21,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:21,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:12:21,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120779711] [2019-12-26 23:12:21,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:12:21,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:21,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:12:21,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:21,603 INFO L87 Difference]: Start difference. First operand 10402 states and 24654 transitions. Second operand 9 states. [2019-12-26 23:12:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:23,094 INFO L93 Difference]: Finished difference Result 15263 states and 36448 transitions. [2019-12-26 23:12:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:12:23,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-26 23:12:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:23,113 INFO L225 Difference]: With dead ends: 15263 [2019-12-26 23:12:23,113 INFO L226 Difference]: Without dead ends: 15263 [2019-12-26 23:12:23,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:12:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15263 states. [2019-12-26 23:12:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15263 to 9616. [2019-12-26 23:12:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9616 states. [2019-12-26 23:12:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9616 states to 9616 states and 22868 transitions. [2019-12-26 23:12:23,253 INFO L78 Accepts]: Start accepts. Automaton has 9616 states and 22868 transitions. Word has length 95 [2019-12-26 23:12:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:23,253 INFO L462 AbstractCegarLoop]: Abstraction has 9616 states and 22868 transitions. [2019-12-26 23:12:23,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:12:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9616 states and 22868 transitions. [2019-12-26 23:12:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:23,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:23,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:23,262 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:23,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1624199791, now seen corresponding path program 5 times [2019-12-26 23:12:23,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:23,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164903168] [2019-12-26 23:12:23,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:23,427 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-26 23:12:23,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164903168] [2019-12-26 23:12:23,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:23,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:12:23,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172910130] [2019-12-26 23:12:23,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:12:23,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:23,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:12:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:23,429 INFO L87 Difference]: Start difference. First operand 9616 states and 22868 transitions. Second operand 10 states. [2019-12-26 23:12:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:24,493 INFO L93 Difference]: Finished difference Result 20952 states and 49187 transitions. [2019-12-26 23:12:24,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:12:24,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-26 23:12:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:24,517 INFO L225 Difference]: With dead ends: 20952 [2019-12-26 23:12:24,517 INFO L226 Difference]: Without dead ends: 19617 [2019-12-26 23:12:24,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:12:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19617 states. [2019-12-26 23:12:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19617 to 13215. [2019-12-26 23:12:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13215 states. [2019-12-26 23:12:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 32001 transitions. [2019-12-26 23:12:24,754 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 32001 transitions. Word has length 95 [2019-12-26 23:12:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:24,754 INFO L462 AbstractCegarLoop]: Abstraction has 13215 states and 32001 transitions. [2019-12-26 23:12:24,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:12:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 32001 transitions. [2019-12-26 23:12:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:24,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:24,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:24,767 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2079306305, now seen corresponding path program 6 times [2019-12-26 23:12:24,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:24,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200460044] [2019-12-26 23:12:24,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:24,848 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-26 23:12:24,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200460044] [2019-12-26 23:12:24,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:24,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:12:24,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252202024] [2019-12-26 23:12:24,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:12:24,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:12:24,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:12:24,852 INFO L87 Difference]: Start difference. First operand 13215 states and 32001 transitions. Second operand 3 states. [2019-12-26 23:12:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:24,936 INFO L93 Difference]: Finished difference Result 9977 states and 24519 transitions. [2019-12-26 23:12:24,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:12:24,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-26 23:12:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:24,953 INFO L225 Difference]: With dead ends: 9977 [2019-12-26 23:12:24,953 INFO L226 Difference]: Without dead ends: 9977 [2019-12-26 23:12:24,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:12:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9977 states. [2019-12-26 23:12:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9977 to 9963. [2019-12-26 23:12:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9963 states. [2019-12-26 23:12:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9963 states to 9963 states and 24493 transitions. [2019-12-26 23:12:25,113 INFO L78 Accepts]: Start accepts. Automaton has 9963 states and 24493 transitions. Word has length 95 [2019-12-26 23:12:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:25,113 INFO L462 AbstractCegarLoop]: Abstraction has 9963 states and 24493 transitions. [2019-12-26 23:12:25,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:12:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 9963 states and 24493 transitions. [2019-12-26 23:12:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:25,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:25,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:25,122 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:25,122 INFO L82 PathProgramCache]: Analyzing trace with hash -382325470, now seen corresponding path program 1 times [2019-12-26 23:12:25,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:25,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137977357] [2019-12-26 23:12:25,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:25,284 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-26 23:12:25,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137977357] [2019-12-26 23:12:25,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:25,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:25,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228017332] [2019-12-26 23:12:25,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:12:25,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:25,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:12:25,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:25,286 INFO L87 Difference]: Start difference. First operand 9963 states and 24493 transitions. Second operand 9 states. [2019-12-26 23:12:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:26,251 INFO L93 Difference]: Finished difference Result 19950 states and 48629 transitions. [2019-12-26 23:12:26,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:12:26,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-26 23:12:26,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:26,274 INFO L225 Difference]: With dead ends: 19950 [2019-12-26 23:12:26,274 INFO L226 Difference]: Without dead ends: 15699 [2019-12-26 23:12:26,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:12:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15699 states. [2019-12-26 23:12:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15699 to 13874. [2019-12-26 23:12:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13874 states. [2019-12-26 23:12:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13874 states to 13874 states and 34181 transitions. [2019-12-26 23:12:26,448 INFO L78 Accepts]: Start accepts. Automaton has 13874 states and 34181 transitions. Word has length 96 [2019-12-26 23:12:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:26,448 INFO L462 AbstractCegarLoop]: Abstraction has 13874 states and 34181 transitions. [2019-12-26 23:12:26,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:12:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 13874 states and 34181 transitions. [2019-12-26 23:12:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:26,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:26,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, 1, 1, 1, 1, 1, 1, 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-26 23:12:26,461 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash -478635746, now seen corresponding path program 2 times [2019-12-26 23:12:26,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:26,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173245857] [2019-12-26 23:12:26,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:26,910 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-26 23:12:26,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173245857] [2019-12-26 23:12:26,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:26,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:12:26,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40522572] [2019-12-26 23:12:26,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:12:26,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:26,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:12:26,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:12:26,912 INFO L87 Difference]: Start difference. First operand 13874 states and 34181 transitions. Second operand 18 states. [2019-12-26 23:12:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:30,113 INFO L93 Difference]: Finished difference Result 27701 states and 67655 transitions. [2019-12-26 23:12:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 23:12:30,113 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-26 23:12:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:30,140 INFO L225 Difference]: With dead ends: 27701 [2019-12-26 23:12:30,140 INFO L226 Difference]: Without dead ends: 24049 [2019-12-26 23:12:30,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2019-12-26 23:12:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24049 states. [2019-12-26 23:12:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24049 to 15080. [2019-12-26 23:12:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15080 states. [2019-12-26 23:12:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15080 states to 15080 states and 37099 transitions. [2019-12-26 23:12:30,366 INFO L78 Accepts]: Start accepts. Automaton has 15080 states and 37099 transitions. Word has length 96 [2019-12-26 23:12:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:30,366 INFO L462 AbstractCegarLoop]: Abstraction has 15080 states and 37099 transitions. [2019-12-26 23:12:30,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:12:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 15080 states and 37099 transitions. [2019-12-26 23:12:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:30,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:30,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:30,380 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash 833007262, now seen corresponding path program 3 times [2019-12-26 23:12:30,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:30,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037703566] [2019-12-26 23:12:30,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:30,609 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-26 23:12:30,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037703566] [2019-12-26 23:12:30,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:30,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:12:30,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365421822] [2019-12-26 23:12:30,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:12:30,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:30,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:12:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:12:30,612 INFO L87 Difference]: Start difference. First operand 15080 states and 37099 transitions. Second operand 13 states. [2019-12-26 23:12:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:32,165 INFO L93 Difference]: Finished difference Result 28542 states and 70715 transitions. [2019-12-26 23:12:32,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-26 23:12:32,165 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-26 23:12:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:32,196 INFO L225 Difference]: With dead ends: 28542 [2019-12-26 23:12:32,197 INFO L226 Difference]: Without dead ends: 25860 [2019-12-26 23:12:32,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 23:12:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25860 states. [2019-12-26 23:12:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25860 to 16079. [2019-12-26 23:12:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16079 states. [2019-12-26 23:12:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16079 states to 16079 states and 40025 transitions. [2019-12-26 23:12:32,439 INFO L78 Accepts]: Start accepts. Automaton has 16079 states and 40025 transitions. Word has length 96 [2019-12-26 23:12:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:32,439 INFO L462 AbstractCegarLoop]: Abstraction has 16079 states and 40025 transitions. [2019-12-26 23:12:32,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:12:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 16079 states and 40025 transitions. [2019-12-26 23:12:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:32,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:32,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:32,454 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:32,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:32,454 INFO L82 PathProgramCache]: Analyzing trace with hash 846630078, now seen corresponding path program 4 times [2019-12-26 23:12:32,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:32,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492318023] [2019-12-26 23:12:32,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:32,648 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-26 23:12:32,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492318023] [2019-12-26 23:12:32,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:32,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:12:32,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640551563] [2019-12-26 23:12:32,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:12:32,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:12:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:32,651 INFO L87 Difference]: Start difference. First operand 16079 states and 40025 transitions. Second operand 10 states. [2019-12-26 23:12:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:33,915 INFO L93 Difference]: Finished difference Result 29546 states and 72283 transitions. [2019-12-26 23:12:33,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 23:12:33,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-26 23:12:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:33,948 INFO L225 Difference]: With dead ends: 29546 [2019-12-26 23:12:33,949 INFO L226 Difference]: Without dead ends: 28205 [2019-12-26 23:12:33,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:12:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28205 states. [2019-12-26 23:12:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28205 to 20842. [2019-12-26 23:12:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20842 states. [2019-12-26 23:12:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20842 states to 20842 states and 52704 transitions. [2019-12-26 23:12:34,471 INFO L78 Accepts]: Start accepts. Automaton has 20842 states and 52704 transitions. Word has length 96 [2019-12-26 23:12:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:34,471 INFO L462 AbstractCegarLoop]: Abstraction has 20842 states and 52704 transitions. [2019-12-26 23:12:34,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:12:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 20842 states and 52704 transitions. [2019-12-26 23:12:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:34,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:34,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:34,492 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 5 times [2019-12-26 23:12:34,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:34,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327956321] [2019-12-26 23:12:34,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:34,647 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-26 23:12:34,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327956321] [2019-12-26 23:12:34,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:34,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:12:34,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742283797] [2019-12-26 23:12:34,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:12:34,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:34,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:12:34,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:34,649 INFO L87 Difference]: Start difference. First operand 20842 states and 52704 transitions. Second operand 10 states. [2019-12-26 23:12:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:35,537 INFO L93 Difference]: Finished difference Result 29744 states and 73982 transitions. [2019-12-26 23:12:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:12:35,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-26 23:12:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:35,574 INFO L225 Difference]: With dead ends: 29744 [2019-12-26 23:12:35,574 INFO L226 Difference]: Without dead ends: 29077 [2019-12-26 23:12:35,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:12:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29077 states. [2019-12-26 23:12:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29077 to 20845. [2019-12-26 23:12:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20845 states. [2019-12-26 23:12:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20845 states to 20845 states and 52708 transitions. [2019-12-26 23:12:35,893 INFO L78 Accepts]: Start accepts. Automaton has 20845 states and 52708 transitions. Word has length 96 [2019-12-26 23:12:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:35,894 INFO L462 AbstractCegarLoop]: Abstraction has 20845 states and 52708 transitions. [2019-12-26 23:12:35,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:12:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 20845 states and 52708 transitions. [2019-12-26 23:12:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:35,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:35,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:35,914 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash 77160258, now seen corresponding path program 6 times [2019-12-26 23:12:35,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:35,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052019880] [2019-12-26 23:12:35,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:35,986 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-26 23:12:35,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052019880] [2019-12-26 23:12:35,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:35,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:12:35,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488739141] [2019-12-26 23:12:35,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:12:35,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:35,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:12:35,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:12:35,988 INFO L87 Difference]: Start difference. First operand 20845 states and 52708 transitions. Second operand 5 states. [2019-12-26 23:12:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:36,556 INFO L93 Difference]: Finished difference Result 26536 states and 66965 transitions. [2019-12-26 23:12:36,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:12:36,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-26 23:12:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:36,596 INFO L225 Difference]: With dead ends: 26536 [2019-12-26 23:12:36,596 INFO L226 Difference]: Without dead ends: 26536 [2019-12-26 23:12:36,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26536 states. [2019-12-26 23:12:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26536 to 21181. [2019-12-26 23:12:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21181 states. [2019-12-26 23:12:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21181 states to 21181 states and 53667 transitions. [2019-12-26 23:12:36,894 INFO L78 Accepts]: Start accepts. Automaton has 21181 states and 53667 transitions. Word has length 96 [2019-12-26 23:12:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:36,894 INFO L462 AbstractCegarLoop]: Abstraction has 21181 states and 53667 transitions. [2019-12-26 23:12:36,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:12:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 21181 states and 53667 transitions. [2019-12-26 23:12:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:36,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:36,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:36,916 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:36,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 7 times [2019-12-26 23:12:36,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:36,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910344525] [2019-12-26 23:12:36,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:37,179 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-26 23:12:37,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910344525] [2019-12-26 23:12:37,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:37,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:12:37,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844042368] [2019-12-26 23:12:37,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:12:37,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:12:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:12:37,181 INFO L87 Difference]: Start difference. First operand 21181 states and 53667 transitions. Second operand 14 states. [2019-12-26 23:12:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:38,344 INFO L93 Difference]: Finished difference Result 27512 states and 68790 transitions. [2019-12-26 23:12:38,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:12:38,344 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-26 23:12:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:38,377 INFO L225 Difference]: With dead ends: 27512 [2019-12-26 23:12:38,378 INFO L226 Difference]: Without dead ends: 27482 [2019-12-26 23:12:38,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:12:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27482 states. [2019-12-26 23:12:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27482 to 24299. [2019-12-26 23:12:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24299 states. [2019-12-26 23:12:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24299 states to 24299 states and 61647 transitions. [2019-12-26 23:12:38,924 INFO L78 Accepts]: Start accepts. Automaton has 24299 states and 61647 transitions. Word has length 96 [2019-12-26 23:12:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:38,924 INFO L462 AbstractCegarLoop]: Abstraction has 24299 states and 61647 transitions. [2019-12-26 23:12:38,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:12:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 24299 states and 61647 transitions. [2019-12-26 23:12:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:38,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:38,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:38,950 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:38,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:38,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1560206146, now seen corresponding path program 8 times [2019-12-26 23:12:38,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:38,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666681549] [2019-12-26 23:12:38,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:39,122 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-26 23:12:39,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666681549] [2019-12-26 23:12:39,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:39,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:12:39,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981124825] [2019-12-26 23:12:39,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:12:39,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:12:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:39,126 INFO L87 Difference]: Start difference. First operand 24299 states and 61647 transitions. Second operand 9 states. [2019-12-26 23:12:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:39,807 INFO L93 Difference]: Finished difference Result 34163 states and 86042 transitions. [2019-12-26 23:12:39,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:12:39,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-26 23:12:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:39,844 INFO L225 Difference]: With dead ends: 34163 [2019-12-26 23:12:39,845 INFO L226 Difference]: Without dead ends: 31079 [2019-12-26 23:12:39,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:12:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31079 states. [2019-12-26 23:12:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31079 to 25186. [2019-12-26 23:12:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25186 states. [2019-12-26 23:12:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25186 states to 25186 states and 63741 transitions. [2019-12-26 23:12:40,172 INFO L78 Accepts]: Start accepts. Automaton has 25186 states and 63741 transitions. Word has length 96 [2019-12-26 23:12:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:40,172 INFO L462 AbstractCegarLoop]: Abstraction has 25186 states and 63741 transitions. [2019-12-26 23:12:40,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:12:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 25186 states and 63741 transitions. [2019-12-26 23:12:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:40,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:40,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:40,195 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:40,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1463895870, now seen corresponding path program 9 times [2019-12-26 23:12:40,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:40,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086872556] [2019-12-26 23:12:40,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:40,329 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-26 23:12:40,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086872556] [2019-12-26 23:12:40,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:40,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:12:40,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461747266] [2019-12-26 23:12:40,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:12:40,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:40,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:12:40,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:40,330 INFO L87 Difference]: Start difference. First operand 25186 states and 63741 transitions. Second operand 9 states. [2019-12-26 23:12:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:41,025 INFO L93 Difference]: Finished difference Result 36298 states and 92154 transitions. [2019-12-26 23:12:41,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:12:41,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-26 23:12:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:41,069 INFO L225 Difference]: With dead ends: 36298 [2019-12-26 23:12:41,069 INFO L226 Difference]: Without dead ends: 34056 [2019-12-26 23:12:41,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:12:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34056 states. [2019-12-26 23:12:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34056 to 25543. [2019-12-26 23:12:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25543 states. [2019-12-26 23:12:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25543 states to 25543 states and 64714 transitions. [2019-12-26 23:12:41,419 INFO L78 Accepts]: Start accepts. Automaton has 25543 states and 64714 transitions. Word has length 96 [2019-12-26 23:12:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:41,419 INFO L462 AbstractCegarLoop]: Abstraction has 25543 states and 64714 transitions. [2019-12-26 23:12:41,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:12:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 25543 states and 64714 transitions. [2019-12-26 23:12:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:41,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:41,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:41,444 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:41,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1519428418, now seen corresponding path program 10 times [2019-12-26 23:12:41,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:41,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193556773] [2019-12-26 23:12:41,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:41,571 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-26 23:12:41,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193556773] [2019-12-26 23:12:41,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:41,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:12:41,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336963579] [2019-12-26 23:12:41,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:41,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:41,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:41,573 INFO L87 Difference]: Start difference. First operand 25543 states and 64714 transitions. Second operand 6 states. [2019-12-26 23:12:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:41,872 INFO L93 Difference]: Finished difference Result 26382 states and 66546 transitions. [2019-12-26 23:12:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:12:41,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-26 23:12:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:41,902 INFO L225 Difference]: With dead ends: 26382 [2019-12-26 23:12:41,902 INFO L226 Difference]: Without dead ends: 26382 [2019-12-26 23:12:41,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:12:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26382 states. [2019-12-26 23:12:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26382 to 25535. [2019-12-26 23:12:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25535 states. [2019-12-26 23:12:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25535 states to 25535 states and 64626 transitions. [2019-12-26 23:12:42,463 INFO L78 Accepts]: Start accepts. Automaton has 25535 states and 64626 transitions. Word has length 96 [2019-12-26 23:12:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:42,463 INFO L462 AbstractCegarLoop]: Abstraction has 25535 states and 64626 transitions. [2019-12-26 23:12:42,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 25535 states and 64626 transitions. [2019-12-26 23:12:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:42,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:42,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:42,492 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash -428888642, now seen corresponding path program 11 times [2019-12-26 23:12:42,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:42,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189480929] [2019-12-26 23:12:42,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:42,664 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-26 23:12:42,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189480929] [2019-12-26 23:12:42,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:42,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:12:42,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896587905] [2019-12-26 23:12:42,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:12:42,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:12:42,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:12:42,666 INFO L87 Difference]: Start difference. First operand 25535 states and 64626 transitions. Second operand 12 states. [2019-12-26 23:12:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:43,807 INFO L93 Difference]: Finished difference Result 33769 states and 84545 transitions. [2019-12-26 23:12:43,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 23:12:43,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-26 23:12:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:43,848 INFO L225 Difference]: With dead ends: 33769 [2019-12-26 23:12:43,848 INFO L226 Difference]: Without dead ends: 32669 [2019-12-26 23:12:43,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:12:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32669 states. [2019-12-26 23:12:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32669 to 24413. [2019-12-26 23:12:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24413 states. [2019-12-26 23:12:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24413 states to 24413 states and 61871 transitions. [2019-12-26 23:12:44,207 INFO L78 Accepts]: Start accepts. Automaton has 24413 states and 61871 transitions. Word has length 96 [2019-12-26 23:12:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:44,207 INFO L462 AbstractCegarLoop]: Abstraction has 24413 states and 61871 transitions. [2019-12-26 23:12:44,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:12:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 24413 states and 61871 transitions. [2019-12-26 23:12:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:44,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:44,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:44,233 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:44,233 INFO L82 PathProgramCache]: Analyzing trace with hash 20377534, now seen corresponding path program 12 times [2019-12-26 23:12:44,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:44,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593166998] [2019-12-26 23:12:44,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:44,417 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-26 23:12:44,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593166998] [2019-12-26 23:12:44,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:44,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:12:44,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512371290] [2019-12-26 23:12:44,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:12:44,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:12:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:12:44,419 INFO L87 Difference]: Start difference. First operand 24413 states and 61871 transitions. Second operand 11 states. [2019-12-26 23:12:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:45,967 INFO L93 Difference]: Finished difference Result 40545 states and 101994 transitions. [2019-12-26 23:12:45,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 23:12:45,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-26 23:12:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:46,012 INFO L225 Difference]: With dead ends: 40545 [2019-12-26 23:12:46,012 INFO L226 Difference]: Without dead ends: 36612 [2019-12-26 23:12:46,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:12:46,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36612 states. [2019-12-26 23:12:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36612 to 25581. [2019-12-26 23:12:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25581 states. [2019-12-26 23:12:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25581 states to 25581 states and 64738 transitions. [2019-12-26 23:12:46,386 INFO L78 Accepts]: Start accepts. Automaton has 25581 states and 64738 transitions. Word has length 96 [2019-12-26 23:12:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:46,386 INFO L462 AbstractCegarLoop]: Abstraction has 25581 states and 64738 transitions. [2019-12-26 23:12:46,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:12:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 25581 states and 64738 transitions. [2019-12-26 23:12:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:46,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:46,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:46,411 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:46,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash -743312710, now seen corresponding path program 13 times [2019-12-26 23:12:46,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:46,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469426994] [2019-12-26 23:12:46,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:46,614 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-26 23:12:46,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469426994] [2019-12-26 23:12:46,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:46,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:12:46,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731521894] [2019-12-26 23:12:46,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:12:46,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:12:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:12:46,617 INFO L87 Difference]: Start difference. First operand 25581 states and 64738 transitions. Second operand 13 states. [2019-12-26 23:12:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:49,004 INFO L93 Difference]: Finished difference Result 38746 states and 97201 transitions. [2019-12-26 23:12:49,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 23:12:49,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-26 23:12:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:49,051 INFO L225 Difference]: With dead ends: 38746 [2019-12-26 23:12:49,051 INFO L226 Difference]: Without dead ends: 37635 [2019-12-26 23:12:49,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 23:12:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37635 states. [2019-12-26 23:12:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37635 to 24653. [2019-12-26 23:12:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24653 states. [2019-12-26 23:12:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24653 states to 24653 states and 62505 transitions. [2019-12-26 23:12:49,457 INFO L78 Accepts]: Start accepts. Automaton has 24653 states and 62505 transitions. Word has length 96 [2019-12-26 23:12:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:49,457 INFO L462 AbstractCegarLoop]: Abstraction has 24653 states and 62505 transitions. [2019-12-26 23:12:49,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:12:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 24653 states and 62505 transitions. [2019-12-26 23:12:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:49,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:49,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:49,486 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash 991988574, now seen corresponding path program 14 times [2019-12-26 23:12:49,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:49,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945170070] [2019-12-26 23:12:49,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:49,699 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-26 23:12:49,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945170070] [2019-12-26 23:12:49,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:49,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:12:49,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048635549] [2019-12-26 23:12:49,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:12:49,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:49,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:12:49,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:12:49,700 INFO L87 Difference]: Start difference. First operand 24653 states and 62505 transitions. Second operand 14 states. [2019-12-26 23:12:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:52,957 INFO L93 Difference]: Finished difference Result 38334 states and 97784 transitions. [2019-12-26 23:12:52,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 23:12:52,958 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-26 23:12:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:53,007 INFO L225 Difference]: With dead ends: 38334 [2019-12-26 23:12:53,007 INFO L226 Difference]: Without dead ends: 38048 [2019-12-26 23:12:53,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:12:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38048 states. [2019-12-26 23:12:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38048 to 26351. [2019-12-26 23:12:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26351 states. [2019-12-26 23:12:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26351 states to 26351 states and 67191 transitions. [2019-12-26 23:12:53,411 INFO L78 Accepts]: Start accepts. Automaton has 26351 states and 67191 transitions. Word has length 96 [2019-12-26 23:12:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:53,411 INFO L462 AbstractCegarLoop]: Abstraction has 26351 states and 67191 transitions. [2019-12-26 23:12:53,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:12:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 26351 states and 67191 transitions. [2019-12-26 23:12:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:12:53,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:53,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:53,438 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-26 23:12:53,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:53,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405886498] [2019-12-26 23:12:53,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:53,648 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-26 23:12:53,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405886498] [2019-12-26 23:12:53,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:53,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:12:53,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030286275] [2019-12-26 23:12:53,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:12:53,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:53,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:12:53,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:12:53,650 INFO L87 Difference]: Start difference. First operand 26351 states and 67191 transitions. Second operand 12 states. [2019-12-26 23:12:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:57,402 INFO L93 Difference]: Finished difference Result 56401 states and 141962 transitions. [2019-12-26 23:12:57,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-26 23:12:57,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-26 23:12:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:57,489 INFO L225 Difference]: With dead ends: 56401 [2019-12-26 23:12:57,489 INFO L226 Difference]: Without dead ends: 48986 [2019-12-26 23:12:57,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=1814, Unknown=0, NotChecked=0, Total=2162 [2019-12-26 23:12:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48986 states. [2019-12-26 23:12:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48986 to 29484. [2019-12-26 23:12:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29484 states. [2019-12-26 23:12:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29484 states to 29484 states and 75318 transitions. [2019-12-26 23:12:58,023 INFO L78 Accepts]: Start accepts. Automaton has 29484 states and 75318 transitions. Word has length 97 [2019-12-26 23:12:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:58,023 INFO L462 AbstractCegarLoop]: Abstraction has 29484 states and 75318 transitions. [2019-12-26 23:12:58,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:12:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 29484 states and 75318 transitions. [2019-12-26 23:12:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:12:58,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:58,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:58,057 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-26 23:12:58,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:58,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430604581] [2019-12-26 23:12:58,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:58,166 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-26 23:12:58,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430604581] [2019-12-26 23:12:58,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:58,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:12:58,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620437353] [2019-12-26 23:12:58,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:58,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:58,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:58,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:58,168 INFO L87 Difference]: Start difference. First operand 29484 states and 75318 transitions. Second operand 6 states. [2019-12-26 23:12:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:58,339 INFO L93 Difference]: Finished difference Result 28930 states and 73751 transitions. [2019-12-26 23:12:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:12:58,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:12:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:58,372 INFO L225 Difference]: With dead ends: 28930 [2019-12-26 23:12:58,372 INFO L226 Difference]: Without dead ends: 28930 [2019-12-26 23:12:58,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:12:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28930 states. [2019-12-26 23:12:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28930 to 22207. [2019-12-26 23:12:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22207 states. [2019-12-26 23:12:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22207 states to 22207 states and 55973 transitions. [2019-12-26 23:12:58,662 INFO L78 Accepts]: Start accepts. Automaton has 22207 states and 55973 transitions. Word has length 97 [2019-12-26 23:12:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:58,662 INFO L462 AbstractCegarLoop]: Abstraction has 22207 states and 55973 transitions. [2019-12-26 23:12:58,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 22207 states and 55973 transitions. [2019-12-26 23:12:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:12:58,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:58,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:12:58,684 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:58,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-26 23:12:58,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:58,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164925865] [2019-12-26 23:12:58,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:58,804 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-26 23:12:58,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164925865] [2019-12-26 23:12:58,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:58,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:58,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370421913] [2019-12-26 23:12:58,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:58,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:58,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:58,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:58,806 INFO L87 Difference]: Start difference. First operand 22207 states and 55973 transitions. Second operand 7 states. [2019-12-26 23:12:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:59,600 INFO L93 Difference]: Finished difference Result 32531 states and 81257 transitions. [2019-12-26 23:12:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:12:59,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-26 23:12:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:59,640 INFO L225 Difference]: With dead ends: 32531 [2019-12-26 23:12:59,640 INFO L226 Difference]: Without dead ends: 32524 [2019-12-26 23:12:59,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32524 states. [2019-12-26 23:13:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32524 to 25819. [2019-12-26 23:13:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25819 states. [2019-12-26 23:13:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25819 states to 25819 states and 65039 transitions. [2019-12-26 23:13:00,224 INFO L78 Accepts]: Start accepts. Automaton has 25819 states and 65039 transitions. Word has length 97 [2019-12-26 23:13:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:00,225 INFO L462 AbstractCegarLoop]: Abstraction has 25819 states and 65039 transitions. [2019-12-26 23:13:00,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 25819 states and 65039 transitions. [2019-12-26 23:13:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:00,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:00,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:00,249 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:00,249 INFO L82 PathProgramCache]: Analyzing trace with hash 559739879, now seen corresponding path program 2 times [2019-12-26 23:13:00,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:00,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296949872] [2019-12-26 23:13:00,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:00,330 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-26 23:13:00,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296949872] [2019-12-26 23:13:00,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:00,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:13:00,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928888951] [2019-12-26 23:13:00,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:00,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:00,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:00,331 INFO L87 Difference]: Start difference. First operand 25819 states and 65039 transitions. Second operand 6 states. [2019-12-26 23:13:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:00,814 INFO L93 Difference]: Finished difference Result 33481 states and 83865 transitions. [2019-12-26 23:13:00,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:13:00,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:13:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:00,853 INFO L225 Difference]: With dead ends: 33481 [2019-12-26 23:13:00,853 INFO L226 Difference]: Without dead ends: 33481 [2019-12-26 23:13:00,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:13:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33481 states. [2019-12-26 23:13:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33481 to 26067. [2019-12-26 23:13:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26067 states. [2019-12-26 23:13:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26067 states to 26067 states and 65646 transitions. [2019-12-26 23:13:01,199 INFO L78 Accepts]: Start accepts. Automaton has 26067 states and 65646 transitions. Word has length 97 [2019-12-26 23:13:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:01,199 INFO L462 AbstractCegarLoop]: Abstraction has 26067 states and 65646 transitions. [2019-12-26 23:13:01,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 26067 states and 65646 transitions. [2019-12-26 23:13:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:01,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:01,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:01,225 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:01,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 3 times [2019-12-26 23:13:01,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:01,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052995310] [2019-12-26 23:13:01,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:01,354 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-26 23:13:01,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052995310] [2019-12-26 23:13:01,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:01,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:01,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690452497] [2019-12-26 23:13:01,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:13:01,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:01,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:13:01,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:13:01,356 INFO L87 Difference]: Start difference. First operand 26067 states and 65646 transitions. Second operand 8 states. [2019-12-26 23:13:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:02,163 INFO L93 Difference]: Finished difference Result 32823 states and 81712 transitions. [2019-12-26 23:13:02,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:13:02,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-26 23:13:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:02,203 INFO L225 Difference]: With dead ends: 32823 [2019-12-26 23:13:02,204 INFO L226 Difference]: Without dead ends: 32816 [2019-12-26 23:13:02,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32816 states. [2019-12-26 23:13:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32816 to 25875. [2019-12-26 23:13:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25875 states. [2019-12-26 23:13:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25875 states to 25875 states and 65166 transitions. [2019-12-26 23:13:02,550 INFO L78 Accepts]: Start accepts. Automaton has 25875 states and 65166 transitions. Word has length 97 [2019-12-26 23:13:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:02,551 INFO L462 AbstractCegarLoop]: Abstraction has 25875 states and 65166 transitions. [2019-12-26 23:13:02,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:13:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 25875 states and 65166 transitions. [2019-12-26 23:13:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:02,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:02,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:02,577 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 4 times [2019-12-26 23:13:02,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:02,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325558217] [2019-12-26 23:13:02,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:03,362 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-26 23:13:03,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325558217] [2019-12-26 23:13:03,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:03,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-26 23:13:03,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003599298] [2019-12-26 23:13:03,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-26 23:13:03,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-26 23:13:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:13:03,365 INFO L87 Difference]: Start difference. First operand 25875 states and 65166 transitions. Second operand 23 states. [2019-12-26 23:13:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:09,185 INFO L93 Difference]: Finished difference Result 32313 states and 81189 transitions. [2019-12-26 23:13:09,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 23:13:09,186 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2019-12-26 23:13:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:09,223 INFO L225 Difference]: With dead ends: 32313 [2019-12-26 23:13:09,223 INFO L226 Difference]: Without dead ends: 32313 [2019-12-26 23:13:09,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=305, Invalid=1675, Unknown=0, NotChecked=0, Total=1980 [2019-12-26 23:13:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32313 states. [2019-12-26 23:13:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32313 to 25992. [2019-12-26 23:13:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25992 states. [2019-12-26 23:13:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25992 states to 25992 states and 65435 transitions. [2019-12-26 23:13:09,556 INFO L78 Accepts]: Start accepts. Automaton has 25992 states and 65435 transitions. Word has length 97 [2019-12-26 23:13:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:09,556 INFO L462 AbstractCegarLoop]: Abstraction has 25992 states and 65435 transitions. [2019-12-26 23:13:09,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-26 23:13:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 25992 states and 65435 transitions. [2019-12-26 23:13:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:09,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:09,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:09,580 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash -34513923, now seen corresponding path program 5 times [2019-12-26 23:13:09,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:09,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882080741] [2019-12-26 23:13:09,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:09,700 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-26 23:13:09,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882080741] [2019-12-26 23:13:09,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:09,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:09,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009439486] [2019-12-26 23:13:09,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:13:09,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:13:09,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:13:09,702 INFO L87 Difference]: Start difference. First operand 25992 states and 65435 transitions. Second operand 7 states. [2019-12-26 23:13:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:10,623 INFO L93 Difference]: Finished difference Result 35248 states and 88441 transitions. [2019-12-26 23:13:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:13:10,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-26 23:13:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:10,667 INFO L225 Difference]: With dead ends: 35248 [2019-12-26 23:13:10,667 INFO L226 Difference]: Without dead ends: 35232 [2019-12-26 23:13:10,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:13:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35232 states. [2019-12-26 23:13:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35232 to 27753. [2019-12-26 23:13:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27753 states. [2019-12-26 23:13:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27753 states to 27753 states and 69945 transitions. [2019-12-26 23:13:11,060 INFO L78 Accepts]: Start accepts. Automaton has 27753 states and 69945 transitions. Word has length 97 [2019-12-26 23:13:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:11,060 INFO L462 AbstractCegarLoop]: Abstraction has 27753 states and 69945 transitions. [2019-12-26 23:13:11,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27753 states and 69945 transitions. [2019-12-26 23:13:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:11,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:11,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:11,089 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:11,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 6 times [2019-12-26 23:13:11,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:11,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747013840] [2019-12-26 23:13:11,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:11,763 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-26 23:13:11,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747013840] [2019-12-26 23:13:11,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:11,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:13:11,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022284510] [2019-12-26 23:13:11,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:13:11,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:11,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:13:11,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:13:11,765 INFO L87 Difference]: Start difference. First operand 27753 states and 69945 transitions. Second operand 19 states. [2019-12-26 23:13:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:14,113 INFO L93 Difference]: Finished difference Result 32296 states and 81027 transitions. [2019-12-26 23:13:14,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:13:14,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-12-26 23:13:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:14,149 INFO L225 Difference]: With dead ends: 32296 [2019-12-26 23:13:14,149 INFO L226 Difference]: Without dead ends: 31584 [2019-12-26 23:13:14,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:13:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31584 states. [2019-12-26 23:13:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31584 to 27760. [2019-12-26 23:13:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27760 states. [2019-12-26 23:13:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27760 states to 27760 states and 69954 transitions. [2019-12-26 23:13:14,490 INFO L78 Accepts]: Start accepts. Automaton has 27760 states and 69954 transitions. Word has length 97 [2019-12-26 23:13:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:14,490 INFO L462 AbstractCegarLoop]: Abstraction has 27760 states and 69954 transitions. [2019-12-26 23:13:14,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:13:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 27760 states and 69954 transitions. [2019-12-26 23:13:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:14,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:14,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:14,517 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:14,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1999136157, now seen corresponding path program 7 times [2019-12-26 23:13:14,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:14,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007992899] [2019-12-26 23:13:14,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:15,036 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-26 23:13:15,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007992899] [2019-12-26 23:13:15,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:15,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:13:15,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327784659] [2019-12-26 23:13:15,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:13:15,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:15,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:13:15,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:13:15,039 INFO L87 Difference]: Start difference. First operand 27760 states and 69954 transitions. Second operand 20 states. [2019-12-26 23:13:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:20,991 INFO L93 Difference]: Finished difference Result 34431 states and 85712 transitions. [2019-12-26 23:13:20,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-26 23:13:20,992 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-26 23:13:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:21,032 INFO L225 Difference]: With dead ends: 34431 [2019-12-26 23:13:21,032 INFO L226 Difference]: Without dead ends: 33295 [2019-12-26 23:13:21,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=563, Invalid=3097, Unknown=0, NotChecked=0, Total=3660 [2019-12-26 23:13:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33295 states. [2019-12-26 23:13:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33295 to 28054. [2019-12-26 23:13:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28054 states. [2019-12-26 23:13:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28054 states to 28054 states and 70601 transitions. [2019-12-26 23:13:21,390 INFO L78 Accepts]: Start accepts. Automaton has 28054 states and 70601 transitions. Word has length 97 [2019-12-26 23:13:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:21,390 INFO L462 AbstractCegarLoop]: Abstraction has 28054 states and 70601 transitions. [2019-12-26 23:13:21,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:13:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 28054 states and 70601 transitions. [2019-12-26 23:13:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:21,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:21,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:21,416 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:21,416 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 8 times [2019-12-26 23:13:21,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:21,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535542029] [2019-12-26 23:13:21,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:21,802 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-26 23:13:21,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535542029] [2019-12-26 23:13:21,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:21,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:21,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130470830] [2019-12-26 23:13:21,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:13:21,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:21,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:13:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:13:21,805 INFO L87 Difference]: Start difference. First operand 28054 states and 70601 transitions. Second operand 8 states. [2019-12-26 23:13:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:22,691 INFO L93 Difference]: Finished difference Result 28481 states and 71437 transitions. [2019-12-26 23:13:22,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:13:22,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-26 23:13:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:22,725 INFO L225 Difference]: With dead ends: 28481 [2019-12-26 23:13:22,726 INFO L226 Difference]: Without dead ends: 28481 [2019-12-26 23:13:22,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:13:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28481 states. [2019-12-26 23:13:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28481 to 27461. [2019-12-26 23:13:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27461 states. [2019-12-26 23:13:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27461 states to 27461 states and 69146 transitions. [2019-12-26 23:13:23,055 INFO L78 Accepts]: Start accepts. Automaton has 27461 states and 69146 transitions. Word has length 97 [2019-12-26 23:13:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:23,055 INFO L462 AbstractCegarLoop]: Abstraction has 27461 states and 69146 transitions. [2019-12-26 23:13:23,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:13:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 27461 states and 69146 transitions. [2019-12-26 23:13:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:23,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:23,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:23,081 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:23,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:23,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1192282811, now seen corresponding path program 9 times [2019-12-26 23:13:23,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:23,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592643188] [2019-12-26 23:13:23,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:23,246 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-26 23:13:23,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592643188] [2019-12-26 23:13:23,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:23,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:23,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922011133] [2019-12-26 23:13:23,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:13:23,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:23,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:13:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:23,249 INFO L87 Difference]: Start difference. First operand 27461 states and 69146 transitions. Second operand 9 states. [2019-12-26 23:13:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:24,172 INFO L93 Difference]: Finished difference Result 35428 states and 88698 transitions. [2019-12-26 23:13:24,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:13:24,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-26 23:13:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:24,215 INFO L225 Difference]: With dead ends: 35428 [2019-12-26 23:13:24,216 INFO L226 Difference]: Without dead ends: 35428 [2019-12-26 23:13:24,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35428 states. [2019-12-26 23:13:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35428 to 26849. [2019-12-26 23:13:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26849 states. [2019-12-26 23:13:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26849 states to 26849 states and 67375 transitions. [2019-12-26 23:13:24,591 INFO L78 Accepts]: Start accepts. Automaton has 26849 states and 67375 transitions. Word has length 97 [2019-12-26 23:13:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:24,591 INFO L462 AbstractCegarLoop]: Abstraction has 26849 states and 67375 transitions. [2019-12-26 23:13:24,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:13:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 26849 states and 67375 transitions. [2019-12-26 23:13:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:24,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:24,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:24,618 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:24,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1147784417, now seen corresponding path program 10 times [2019-12-26 23:13:24,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:24,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014333454] [2019-12-26 23:13:24,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:24,793 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-26 23:13:24,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014333454] [2019-12-26 23:13:24,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:24,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:13:24,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709454546] [2019-12-26 23:13:24,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:13:24,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:24,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:13:24,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:24,795 INFO L87 Difference]: Start difference. First operand 26849 states and 67375 transitions. Second operand 10 states. [2019-12-26 23:13:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:26,119 INFO L93 Difference]: Finished difference Result 37533 states and 93865 transitions. [2019-12-26 23:13:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:13:26,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-26 23:13:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:26,162 INFO L225 Difference]: With dead ends: 37533 [2019-12-26 23:13:26,162 INFO L226 Difference]: Without dead ends: 37526 [2019-12-26 23:13:26,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:13:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37526 states. [2019-12-26 23:13:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37526 to 25625. [2019-12-26 23:13:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25625 states. [2019-12-26 23:13:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25625 states to 25625 states and 64218 transitions. [2019-12-26 23:13:26,514 INFO L78 Accepts]: Start accepts. Automaton has 25625 states and 64218 transitions. Word has length 97 [2019-12-26 23:13:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:26,515 INFO L462 AbstractCegarLoop]: Abstraction has 25625 states and 64218 transitions. [2019-12-26 23:13:26,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:13:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 25625 states and 64218 transitions. [2019-12-26 23:13:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:26,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:26,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:26,538 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1419727447, now seen corresponding path program 11 times [2019-12-26 23:13:26,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:26,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759517999] [2019-12-26 23:13:26,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:26,687 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-26 23:13:26,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759517999] [2019-12-26 23:13:26,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:26,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:26,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115036974] [2019-12-26 23:13:26,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:13:26,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:13:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:26,689 INFO L87 Difference]: Start difference. First operand 25625 states and 64218 transitions. Second operand 9 states. [2019-12-26 23:13:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:27,863 INFO L93 Difference]: Finished difference Result 35317 states and 87903 transitions. [2019-12-26 23:13:27,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:13:27,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-26 23:13:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:27,906 INFO L225 Difference]: With dead ends: 35317 [2019-12-26 23:13:27,906 INFO L226 Difference]: Without dead ends: 35317 [2019-12-26 23:13:27,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:13:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35317 states. [2019-12-26 23:13:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35317 to 25282. [2019-12-26 23:13:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25282 states. [2019-12-26 23:13:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25282 states to 25282 states and 63106 transitions. [2019-12-26 23:13:28,261 INFO L78 Accepts]: Start accepts. Automaton has 25282 states and 63106 transitions. Word has length 97 [2019-12-26 23:13:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:28,261 INFO L462 AbstractCegarLoop]: Abstraction has 25282 states and 63106 transitions. [2019-12-26 23:13:28,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:13:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 25282 states and 63106 transitions. [2019-12-26 23:13:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:28,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:28,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:28,286 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash -920339781, now seen corresponding path program 12 times [2019-12-26 23:13:28,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:28,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913249505] [2019-12-26 23:13:28,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:28,447 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-26 23:13:28,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913249505] [2019-12-26 23:13:28,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:28,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:13:28,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980325] [2019-12-26 23:13:28,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:13:28,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:28,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:13:28,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:28,449 INFO L87 Difference]: Start difference. First operand 25282 states and 63106 transitions. Second operand 10 states. [2019-12-26 23:13:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:29,788 INFO L93 Difference]: Finished difference Result 38950 states and 96775 transitions. [2019-12-26 23:13:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:13:29,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-26 23:13:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:29,835 INFO L225 Difference]: With dead ends: 38950 [2019-12-26 23:13:29,835 INFO L226 Difference]: Without dead ends: 38943 [2019-12-26 23:13:29,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:13:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38943 states. [2019-12-26 23:13:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38943 to 24165. [2019-12-26 23:13:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24165 states. [2019-12-26 23:13:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24165 states to 24165 states and 60183 transitions. [2019-12-26 23:13:30,198 INFO L78 Accepts]: Start accepts. Automaton has 24165 states and 60183 transitions. Word has length 97 [2019-12-26 23:13:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:30,198 INFO L462 AbstractCegarLoop]: Abstraction has 24165 states and 60183 transitions. [2019-12-26 23:13:30,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:13:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 24165 states and 60183 transitions. [2019-12-26 23:13:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:30,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:30,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:30,223 INFO L410 AbstractCegarLoop]: === Iteration 51 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 632383657, now seen corresponding path program 13 times [2019-12-26 23:13:30,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:30,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192861304] [2019-12-26 23:13:30,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:30,371 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-26 23:13:30,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192861304] [2019-12-26 23:13:30,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:30,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:30,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135165482] [2019-12-26 23:13:30,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:13:30,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:13:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:30,373 INFO L87 Difference]: Start difference. First operand 24165 states and 60183 transitions. Second operand 9 states. [2019-12-26 23:13:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:31,668 INFO L93 Difference]: Finished difference Result 33410 states and 82990 transitions. [2019-12-26 23:13:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:13:31,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-26 23:13:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:31,711 INFO L225 Difference]: With dead ends: 33410 [2019-12-26 23:13:31,711 INFO L226 Difference]: Without dead ends: 33410 [2019-12-26 23:13:31,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:13:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33410 states. [2019-12-26 23:13:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33410 to 24257. [2019-12-26 23:13:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24257 states. [2019-12-26 23:13:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24257 states to 24257 states and 60402 transitions. [2019-12-26 23:13:32,048 INFO L78 Accepts]: Start accepts. Automaton has 24257 states and 60402 transitions. Word has length 97 [2019-12-26 23:13:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:32,048 INFO L462 AbstractCegarLoop]: Abstraction has 24257 states and 60402 transitions. [2019-12-26 23:13:32,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:13:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 24257 states and 60402 transitions. [2019-12-26 23:13:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:32,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:32,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:32,070 INFO L410 AbstractCegarLoop]: === Iteration 52 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:32,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1707683571, now seen corresponding path program 14 times [2019-12-26 23:13:32,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:32,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477167405] [2019-12-26 23:13:32,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:32,224 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-26 23:13:32,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477167405] [2019-12-26 23:13:32,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:32,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:13:32,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142107447] [2019-12-26 23:13:32,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:13:32,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:13:32,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:13:32,226 INFO L87 Difference]: Start difference. First operand 24257 states and 60402 transitions. Second operand 11 states. [2019-12-26 23:13:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:34,166 INFO L93 Difference]: Finished difference Result 32687 states and 80836 transitions. [2019-12-26 23:13:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:13:34,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-26 23:13:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:34,206 INFO L225 Difference]: With dead ends: 32687 [2019-12-26 23:13:34,206 INFO L226 Difference]: Without dead ends: 32687 [2019-12-26 23:13:34,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:13:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32687 states. [2019-12-26 23:13:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32687 to 24200. [2019-12-26 23:13:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24200 states. [2019-12-26 23:13:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24200 states to 24200 states and 60263 transitions. [2019-12-26 23:13:34,555 INFO L78 Accepts]: Start accepts. Automaton has 24200 states and 60263 transitions. Word has length 97 [2019-12-26 23:13:34,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:34,555 INFO L462 AbstractCegarLoop]: Abstraction has 24200 states and 60263 transitions. [2019-12-26 23:13:34,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:13:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 24200 states and 60263 transitions. [2019-12-26 23:13:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:34,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:34,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:34,577 INFO L410 AbstractCegarLoop]: === Iteration 53 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:34,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1094189681, now seen corresponding path program 15 times [2019-12-26 23:13:34,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:34,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946654006] [2019-12-26 23:13:34,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:34,742 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-26 23:13:34,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946654006] [2019-12-26 23:13:34,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:34,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:13:34,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038530377] [2019-12-26 23:13:34,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:13:34,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:34,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:13:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:34,744 INFO L87 Difference]: Start difference. First operand 24200 states and 60263 transitions. Second operand 10 states. [2019-12-26 23:13:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:36,091 INFO L93 Difference]: Finished difference Result 35857 states and 89430 transitions. [2019-12-26 23:13:36,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:13:36,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-26 23:13:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:36,134 INFO L225 Difference]: With dead ends: 35857 [2019-12-26 23:13:36,135 INFO L226 Difference]: Without dead ends: 35850 [2019-12-26 23:13:36,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:13:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-12-26 23:13:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 24133. [2019-12-26 23:13:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24133 states. [2019-12-26 23:13:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24133 states to 24133 states and 60106 transitions. [2019-12-26 23:13:36,471 INFO L78 Accepts]: Start accepts. Automaton has 24133 states and 60106 transitions. Word has length 97 [2019-12-26 23:13:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:36,472 INFO L462 AbstractCegarLoop]: Abstraction has 24133 states and 60106 transitions. [2019-12-26 23:13:36,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:13:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 24133 states and 60106 transitions. [2019-12-26 23:13:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:13:36,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:36,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:36,496 INFO L410 AbstractCegarLoop]: === Iteration 54 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash -758422154, now seen corresponding path program 1 times [2019-12-26 23:13:36,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:36,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000871910] [2019-12-26 23:13:36,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:37,082 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-26 23:13:37,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000871910] [2019-12-26 23:13:37,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:37,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:13:37,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132125060] [2019-12-26 23:13:37,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:13:37,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:13:37,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:13:37,085 INFO L87 Difference]: Start difference. First operand 24133 states and 60106 transitions. Second operand 17 states. [2019-12-26 23:13:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:42,213 INFO L93 Difference]: Finished difference Result 36698 states and 91455 transitions. [2019-12-26 23:13:42,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-26 23:13:42,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-12-26 23:13:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:42,252 INFO L225 Difference]: With dead ends: 36698 [2019-12-26 23:13:42,252 INFO L226 Difference]: Without dead ends: 35482 [2019-12-26 23:13:42,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=2216, Unknown=0, NotChecked=0, Total=2652 [2019-12-26 23:13:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35482 states. [2019-12-26 23:13:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35482 to 24300. [2019-12-26 23:13:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-26 23:13:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 60496 transitions. [2019-12-26 23:13:42,571 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 60496 transitions. Word has length 98 [2019-12-26 23:13:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:42,571 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 60496 transitions. [2019-12-26 23:13:42,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:13:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 60496 transitions. [2019-12-26 23:13:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:13:42,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:42,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:42,596 INFO L410 AbstractCegarLoop]: === Iteration 55 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash 820119886, now seen corresponding path program 2 times [2019-12-26 23:13:42,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:42,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416373912] [2019-12-26 23:13:42,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:43,868 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-26 23:13:43,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416373912] [2019-12-26 23:13:43,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:43,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-26 23:13:43,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497394864] [2019-12-26 23:13:43,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-26 23:13:43,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:43,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-26 23:13:43,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:13:43,871 INFO L87 Difference]: Start difference. First operand 24300 states and 60496 transitions. Second operand 27 states. [2019-12-26 23:13:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:50,427 INFO L93 Difference]: Finished difference Result 29001 states and 71476 transitions. [2019-12-26 23:13:50,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-26 23:13:50,427 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 98 [2019-12-26 23:13:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:50,460 INFO L225 Difference]: With dead ends: 29001 [2019-12-26 23:13:50,461 INFO L226 Difference]: Without dead ends: 28066 [2019-12-26 23:13:50,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=262, Invalid=1994, Unknown=0, NotChecked=0, Total=2256 [2019-12-26 23:13:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28066 states. [2019-12-26 23:13:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28066 to 26186. [2019-12-26 23:13:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26186 states. [2019-12-26 23:13:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26186 states to 26186 states and 65069 transitions. [2019-12-26 23:13:50,772 INFO L78 Accepts]: Start accepts. Automaton has 26186 states and 65069 transitions. Word has length 98 [2019-12-26 23:13:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:50,772 INFO L462 AbstractCegarLoop]: Abstraction has 26186 states and 65069 transitions. [2019-12-26 23:13:50,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-26 23:13:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 26186 states and 65069 transitions. [2019-12-26 23:13:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:13:50,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:50,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:50,797 INFO L410 AbstractCegarLoop]: === Iteration 56 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:50,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1478539378, now seen corresponding path program 3 times [2019-12-26 23:13:50,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:50,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295061672] [2019-12-26 23:13:50,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:51,594 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-12-26 23:13:51,835 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-26 23:13:51,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295061672] [2019-12-26 23:13:51,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:51,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-26 23:13:51,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146574008] [2019-12-26 23:13:51,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-26 23:13:51,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:51,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-26 23:13:51,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:13:51,837 INFO L87 Difference]: Start difference. First operand 26186 states and 65069 transitions. Second operand 26 states. [2019-12-26 23:13:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:57,918 INFO L93 Difference]: Finished difference Result 28702 states and 70675 transitions. [2019-12-26 23:13:57,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 23:13:57,919 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2019-12-26 23:13:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:57,956 INFO L225 Difference]: With dead ends: 28702 [2019-12-26 23:13:57,956 INFO L226 Difference]: Without dead ends: 28135 [2019-12-26 23:13:57,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=239, Invalid=1923, Unknown=0, NotChecked=0, Total=2162 [2019-12-26 23:13:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28135 states. [2019-12-26 23:13:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28135 to 26192. [2019-12-26 23:13:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26192 states. [2019-12-26 23:13:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26192 states to 26192 states and 65075 transitions. [2019-12-26 23:13:58,300 INFO L78 Accepts]: Start accepts. Automaton has 26192 states and 65075 transitions. Word has length 98 [2019-12-26 23:13:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:58,300 INFO L462 AbstractCegarLoop]: Abstraction has 26192 states and 65075 transitions. [2019-12-26 23:13:58,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-26 23:13:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 26192 states and 65075 transitions. [2019-12-26 23:13:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:13:58,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:58,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:58,324 INFO L410 AbstractCegarLoop]: === Iteration 57 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:58,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1700655026, now seen corresponding path program 4 times [2019-12-26 23:13:58,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:58,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505921597] [2019-12-26 23:13:58,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:58,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505921597] [2019-12-26 23:13:58,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:58,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:13:58,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184550123] [2019-12-26 23:13:58,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:13:58,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:58,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:13:58,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:13:58,903 INFO L87 Difference]: Start difference. First operand 26192 states and 65075 transitions. Second operand 18 states. [2019-12-26 23:14:03,678 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-12-26 23:14:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:07,972 INFO L93 Difference]: Finished difference Result 51065 states and 126345 transitions. [2019-12-26 23:14:07,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-26 23:14:07,972 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-12-26 23:14:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:08,034 INFO L225 Difference]: With dead ends: 51065 [2019-12-26 23:14:08,034 INFO L226 Difference]: Without dead ends: 49309 [2019-12-26 23:14:08,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=684, Invalid=6288, Unknown=0, NotChecked=0, Total=6972 [2019-12-26 23:14:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49309 states. [2019-12-26 23:14:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49309 to 29388. [2019-12-26 23:14:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29388 states. [2019-12-26 23:14:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29388 states to 29388 states and 73374 transitions. [2019-12-26 23:14:08,489 INFO L78 Accepts]: Start accepts. Automaton has 29388 states and 73374 transitions. Word has length 98 [2019-12-26 23:14:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:08,490 INFO L462 AbstractCegarLoop]: Abstraction has 29388 states and 73374 transitions. [2019-12-26 23:14:08,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:14:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 29388 states and 73374 transitions. [2019-12-26 23:14:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:14:08,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:08,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:14:08,517 INFO L410 AbstractCegarLoop]: === Iteration 58 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash 438799118, now seen corresponding path program 5 times [2019-12-26 23:14:08,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:08,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250959277] [2019-12-26 23:14:08,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:09,340 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-26 23:14:09,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250959277] [2019-12-26 23:14:09,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:09,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:14:09,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175979474] [2019-12-26 23:14:09,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:14:09,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:09,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:14:09,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:14:09,342 INFO L87 Difference]: Start difference. First operand 29388 states and 73374 transitions. Second operand 20 states. [2019-12-26 23:14:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:20,062 INFO L93 Difference]: Finished difference Result 45781 states and 113271 transitions. [2019-12-26 23:14:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-26 23:14:20,062 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-12-26 23:14:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:20,122 INFO L225 Difference]: With dead ends: 45781 [2019-12-26 23:14:20,122 INFO L226 Difference]: Without dead ends: 44966 [2019-12-26 23:14:20,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2717 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=814, Invalid=7928, Unknown=0, NotChecked=0, Total=8742 [2019-12-26 23:14:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44966 states. [2019-12-26 23:14:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44966 to 29755. [2019-12-26 23:14:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-26 23:14:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 74241 transitions. [2019-12-26 23:14:20,558 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 74241 transitions. Word has length 98 [2019-12-26 23:14:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:20,558 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 74241 transitions. [2019-12-26 23:14:20,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:14:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 74241 transitions. [2019-12-26 23:14:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:14:20,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:20,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:14:20,586 INFO L410 AbstractCegarLoop]: === Iteration 59 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1521203020, now seen corresponding path program 6 times [2019-12-26 23:14:20,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:20,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108770168] [2019-12-26 23:14:20,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:21,157 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-26 23:14:21,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108770168] [2019-12-26 23:14:21,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:21,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:14:21,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906386291] [2019-12-26 23:14:21,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:14:21,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:14:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:14:21,158 INFO L87 Difference]: Start difference. First operand 29755 states and 74241 transitions. Second operand 20 states. [2019-12-26 23:14:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:30,432 INFO L93 Difference]: Finished difference Result 42916 states and 106614 transitions. [2019-12-26 23:14:30,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-26 23:14:30,432 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-12-26 23:14:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:30,482 INFO L225 Difference]: With dead ends: 42916 [2019-12-26 23:14:30,483 INFO L226 Difference]: Without dead ends: 42674 [2019-12-26 23:14:30,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=631, Invalid=6341, Unknown=0, NotChecked=0, Total=6972 [2019-12-26 23:14:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42674 states. [2019-12-26 23:14:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42674 to 29866. [2019-12-26 23:14:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29866 states. [2019-12-26 23:14:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29866 states to 29866 states and 74491 transitions. [2019-12-26 23:14:30,921 INFO L78 Accepts]: Start accepts. Automaton has 29866 states and 74491 transitions. Word has length 98 [2019-12-26 23:14:30,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:30,921 INFO L462 AbstractCegarLoop]: Abstraction has 29866 states and 74491 transitions. [2019-12-26 23:14:30,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:14:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 29866 states and 74491 transitions. [2019-12-26 23:14:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:14:30,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:30,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:14:30,949 INFO L410 AbstractCegarLoop]: === Iteration 60 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash -106386274, now seen corresponding path program 7 times [2019-12-26 23:14:30,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:30,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776573202] [2019-12-26 23:14:30,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:31,506 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-26 23:14:31,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776573202] [2019-12-26 23:14:31,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:31,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:14:31,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895404581] [2019-12-26 23:14:31,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:14:31,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:31,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:14:31,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:14:31,508 INFO L87 Difference]: Start difference. First operand 29866 states and 74491 transitions. Second operand 20 states. [2019-12-26 23:14:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:40,862 INFO L93 Difference]: Finished difference Result 44557 states and 110677 transitions. [2019-12-26 23:14:40,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-26 23:14:40,863 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-12-26 23:14:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:40,911 INFO L225 Difference]: With dead ends: 44557 [2019-12-26 23:14:40,912 INFO L226 Difference]: Without dead ends: 44093 [2019-12-26 23:14:40,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=686, Invalid=6624, Unknown=0, NotChecked=0, Total=7310 [2019-12-26 23:14:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44093 states. [2019-12-26 23:14:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44093 to 29713. [2019-12-26 23:14:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29713 states. [2019-12-26 23:14:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29713 states to 29713 states and 74142 transitions. [2019-12-26 23:14:41,344 INFO L78 Accepts]: Start accepts. Automaton has 29713 states and 74142 transitions. Word has length 98 [2019-12-26 23:14:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:41,345 INFO L462 AbstractCegarLoop]: Abstraction has 29713 states and 74142 transitions. [2019-12-26 23:14:41,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:14:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 29713 states and 74142 transitions. [2019-12-26 23:14:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:14:41,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:41,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:14:41,375 INFO L410 AbstractCegarLoop]: === Iteration 61 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:41,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2116686574, now seen corresponding path program 8 times [2019-12-26 23:14:41,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:41,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386898463] [2019-12-26 23:14:41,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:42,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386898463] [2019-12-26 23:14:42,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:42,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-26 23:14:42,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970056681] [2019-12-26 23:14:42,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-26 23:14:42,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:42,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-26 23:14:42,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:14:42,196 INFO L87 Difference]: Start difference. First operand 29713 states and 74142 transitions. Second operand 26 states. [2019-12-26 23:14:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:48,961 INFO L93 Difference]: Finished difference Result 33225 states and 82098 transitions. [2019-12-26 23:14:48,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-26 23:14:48,962 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2019-12-26 23:14:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:49,148 INFO L225 Difference]: With dead ends: 33225 [2019-12-26 23:14:49,148 INFO L226 Difference]: Without dead ends: 32194 [2019-12-26 23:14:49,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=307, Invalid=2663, Unknown=0, NotChecked=0, Total=2970 [2019-12-26 23:14:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32194 states. [2019-12-26 23:14:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32194 to 29839. [2019-12-26 23:14:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29839 states. [2019-12-26 23:14:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29839 states to 29839 states and 74435 transitions. [2019-12-26 23:14:49,511 INFO L78 Accepts]: Start accepts. Automaton has 29839 states and 74435 transitions. Word has length 98 [2019-12-26 23:14:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:49,511 INFO L462 AbstractCegarLoop]: Abstraction has 29839 states and 74435 transitions. [2019-12-26 23:14:49,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-26 23:14:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 29839 states and 74435 transitions. [2019-12-26 23:14:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:14:49,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:49,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:14:49,539 INFO L410 AbstractCegarLoop]: === Iteration 62 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:49,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:49,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1869461646, now seen corresponding path program 9 times [2019-12-26 23:14:49,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:49,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169043820] [2019-12-26 23:14:49,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:50,036 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-26 23:14:50,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169043820] [2019-12-26 23:14:50,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:50,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-26 23:14:50,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743144105] [2019-12-26 23:14:50,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-26 23:14:50,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:50,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-26 23:14:50,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:14:50,038 INFO L87 Difference]: Start difference. First operand 29839 states and 74435 transitions. Second operand 22 states. Received shutdown request... [2019-12-26 23:14:52,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:14:52,627 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-26 23:14:52,632 WARN L227 ceAbstractionStarter]: Timeout [2019-12-26 23:14:52,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:14:52 BasicIcfg [2019-12-26 23:14:52,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:14:52,634 INFO L168 Benchmark]: Toolchain (without parser) took 225979.30 ms. Allocated memory was 143.7 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-26 23:14:52,634 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:14:52,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.61 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 99.4 MB in the beginning and 152.5 MB in the end (delta: -53.1 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:52,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.82 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:52,635 INFO L168 Benchmark]: Boogie Preprocessor took 73.11 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 146.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:52,635 INFO L168 Benchmark]: RCFGBuilder took 1350.39 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 146.3 MB in the beginning and 191.1 MB in the end (delta: -44.8 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:52,635 INFO L168 Benchmark]: TraceAbstraction took 223639.90 ms. Allocated memory was 231.7 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 189.7 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-26 23:14:52,637 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.61 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 99.4 MB in the beginning and 152.5 MB in the end (delta: -53.1 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.82 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.11 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 146.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1350.39 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 146.3 MB in the beginning and 191.1 MB in the end (delta: -44.8 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223639.90 ms. Allocated memory was 231.7 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 189.7 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.8s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.4s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (29839states) and FLOYD_HOARE automaton (currently 23 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (13475 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (29839states) and FLOYD_HOARE automaton (currently 23 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (13475 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 223.3s, OverallIterations: 62, TraceHistogramMax: 1, AutomataDifference: 145.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 27316 SDtfs, 38371 SDslu, 161664 SDs, 0 SdLazy, 115600 SolverSat, 2134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 89.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1741 GetRequests, 204 SyntacticMatches, 135 SemanticMatches, 1402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16291 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152836occurred 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: 36.7s AutomataMinimizationTime, 61 MinimizatonAttempts, 376289 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 5525 NumberOfCodeBlocks, 5525 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 5463 ConstructedInterpolants, 0 QuantifiedInterpolants, 2448685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 62 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