/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/forester-heap/dll-rb-cnstr_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:26:08,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:26:08,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:26:08,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:26:08,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:26:08,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:26:08,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:26:08,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:26:08,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:26:08,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:26:08,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:26:08,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:26:08,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:26:08,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:26:08,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:26:08,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:26:08,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:26:08,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:26:08,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:26:08,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:26:08,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:26:08,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:26:08,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:26:08,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:26:08,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:26:08,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:26:08,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:26:08,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:26:08,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:26:08,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:26:08,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:26:08,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:26:08,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:26:08,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:26:08,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:26:08,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:26:08,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:26:08,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:26:08,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:26:08,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:26:08,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:26:08,555 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-11-23 21:26:08,582 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:26:08,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:26:08,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:26:08,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:26:08,586 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:26:08,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:26:08,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:26:08,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:26:08,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:26:08,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:26:08,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:26:08,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:26:08,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:26:08,589 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:26:08,589 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:26:08,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:26:08,590 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:26:08,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:26:08,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:26:08,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:26:08,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:26:08,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:26:08,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:26:08,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:26:08,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:26:08,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:26:08,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:26:08,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:26:08,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:26:08,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:26:08,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:26:08,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:26:08,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:26:08,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:26:08,908 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:26:08,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2019-11-23 21:26:08,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f7e58f7/05417429284a4687930dda0ca7d62e2c/FLAGf6a7cb06f [2019-11-23 21:26:09,526 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:26:09,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2019-11-23 21:26:09,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f7e58f7/05417429284a4687930dda0ca7d62e2c/FLAGf6a7cb06f [2019-11-23 21:26:09,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f7e58f7/05417429284a4687930dda0ca7d62e2c [2019-11-23 21:26:09,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:26:09,984 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:26:09,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:26:09,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:26:09,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:26:09,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:26:09" (1/1) ... [2019-11-23 21:26:09,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182f03c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:09, skipping insertion in model container [2019-11-23 21:26:09,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:26:09" (1/1) ... [2019-11-23 21:26:09,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:26:10,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:26:10,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:26:10,511 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:26:10,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:26:10,611 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:26:10,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10 WrapperNode [2019-11-23 21:26:10,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:26:10,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:26:10,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:26:10,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:26:10,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (1/1) ... [2019-11-23 21:26:10,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (1/1) ... [2019-11-23 21:26:10,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:26:10,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:26:10,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:26:10,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:26:10,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (1/1) ... [2019-11-23 21:26:10,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (1/1) ... [2019-11-23 21:26:10,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (1/1) ... [2019-11-23 21:26:10,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (1/1) ... [2019-11-23 21:26:10,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (1/1) ... [2019-11-23 21:26:10,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (1/1) ... [2019-11-23 21:26:10,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (1/1) ... [2019-11-23 21:26:10,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:26:10,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:26:10,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:26:10,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:26:10,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (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-11-23 21:26:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:26:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:26:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:26:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:26:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:26:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:26:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:26:10,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:26:11,259 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:26:11,260 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-23 21:26:11,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:26:11 BoogieIcfgContainer [2019-11-23 21:26:11,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:26:11,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:26:11,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:26:11,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:26:11,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:26:09" (1/3) ... [2019-11-23 21:26:11,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a815b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:26:11, skipping insertion in model container [2019-11-23 21:26:11,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:26:10" (2/3) ... [2019-11-23 21:26:11,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a815b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:26:11, skipping insertion in model container [2019-11-23 21:26:11,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:26:11" (3/3) ... [2019-11-23 21:26:11,276 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2019-11-23 21:26:11,287 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:26:11,296 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-23 21:26:11,308 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-23 21:26:11,335 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:26:11,335 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:26:11,335 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:26:11,335 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:26:11,336 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:26:11,336 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:26:11,336 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:26:11,336 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:26:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-23 21:26:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-23 21:26:11,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:11,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-23 21:26:11,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-11-23 21:26:11,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:11,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601523649] [2019-11-23 21:26:11,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:11,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601523649] [2019-11-23 21:26:11,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:26:11,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:26:11,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62652174] [2019-11-23 21:26:11,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:26:11,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:11,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:26:11,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:26:11,534 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-23 21:26:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:11,558 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-11-23 21:26:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:26:11,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-23 21:26:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:11,570 INFO L225 Difference]: With dead ends: 92 [2019-11-23 21:26:11,570 INFO L226 Difference]: Without dead ends: 41 [2019-11-23 21:26:11,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:26:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-23 21:26:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-23 21:26:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-23 21:26:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-11-23 21:26:11,611 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-11-23 21:26:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:11,611 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-11-23 21:26:11,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:26:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-11-23 21:26:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-23 21:26:11,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:11,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:11,613 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:11,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:11,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-11-23 21:26:11,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:11,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438788219] [2019-11-23 21:26:11,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:11,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438788219] [2019-11-23 21:26:11,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:26:11,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:26:11,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572104066] [2019-11-23 21:26:11,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:26:11,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:26:11,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:26:11,719 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-11-23 21:26:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:11,846 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-11-23 21:26:11,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:26:11,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-23 21:26:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:11,849 INFO L225 Difference]: With dead ends: 44 [2019-11-23 21:26:11,849 INFO L226 Difference]: Without dead ends: 40 [2019-11-23 21:26:11,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-23 21:26:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-23 21:26:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-23 21:26:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-23 21:26:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-23 21:26:11,863 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 7 [2019-11-23 21:26:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:11,864 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-23 21:26:11,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:26:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-23 21:26:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 21:26:11,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:11,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:11,867 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-11-23 21:26:11,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:11,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632285449] [2019-11-23 21:26:11,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:11,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632285449] [2019-11-23 21:26:11,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:26:11,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:26:11,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220767246] [2019-11-23 21:26:11,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:26:11,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:26:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:26:11,975 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 4 states. [2019-11-23 21:26:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:12,054 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-11-23 21:26:12,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:26:12,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-23 21:26:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:12,056 INFO L225 Difference]: With dead ends: 37 [2019-11-23 21:26:12,056 INFO L226 Difference]: Without dead ends: 35 [2019-11-23 21:26:12,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-23 21:26:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-23 21:26:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-23 21:26:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-23 21:26:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-23 21:26:12,063 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 8 [2019-11-23 21:26:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:12,063 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-23 21:26:12,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:26:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-23 21:26:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 21:26:12,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:12,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:12,065 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-11-23 21:26:12,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:12,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727594952] [2019-11-23 21:26:12,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:12,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727594952] [2019-11-23 21:26:12,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:26:12,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:26:12,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88007204] [2019-11-23 21:26:12,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:26:12,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:12,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:26:12,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:26:12,216 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 5 states. [2019-11-23 21:26:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:12,407 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-11-23 21:26:12,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:26:12,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-23 21:26:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:12,410 INFO L225 Difference]: With dead ends: 60 [2019-11-23 21:26:12,410 INFO L226 Difference]: Without dead ends: 58 [2019-11-23 21:26:12,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:26:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-23 21:26:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2019-11-23 21:26:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 21:26:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-23 21:26:12,425 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 10 [2019-11-23 21:26:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:12,426 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-23 21:26:12,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:26:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-23 21:26:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 21:26:12,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:12,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:12,430 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-11-23 21:26:12,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:12,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12978424] [2019-11-23 21:26:12,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:12,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12978424] [2019-11-23 21:26:12,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:26:12,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:26:12,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650998687] [2019-11-23 21:26:12,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:26:12,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:26:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:26:12,549 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-11-23 21:26:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:12,658 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-23 21:26:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:26:12,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 21:26:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:12,660 INFO L225 Difference]: With dead ends: 42 [2019-11-23 21:26:12,660 INFO L226 Difference]: Without dead ends: 40 [2019-11-23 21:26:12,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-23 21:26:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-23 21:26:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-23 21:26:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-23 21:26:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-23 21:26:12,666 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2019-11-23 21:26:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:12,667 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-23 21:26:12,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:26:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-23 21:26:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 21:26:12,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:12,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:12,668 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-11-23 21:26:12,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:12,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238377811] [2019-11-23 21:26:12,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:12,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238377811] [2019-11-23 21:26:12,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:26:12,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:26:12,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33857054] [2019-11-23 21:26:12,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:26:12,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:26:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:26:12,826 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-11-23 21:26:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:12,938 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-23 21:26:12,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:26:12,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-23 21:26:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:12,939 INFO L225 Difference]: With dead ends: 55 [2019-11-23 21:26:12,939 INFO L226 Difference]: Without dead ends: 43 [2019-11-23 21:26:12,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-11-23 21:26:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-23 21:26:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-11-23 21:26:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 21:26:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-23 21:26:12,953 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2019-11-23 21:26:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:12,954 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-23 21:26:12,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:26:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-23 21:26:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 21:26:12,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:12,957 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:12,957 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-11-23 21:26:12,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:12,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578225698] [2019-11-23 21:26:12,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:13,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578225698] [2019-11-23 21:26:13,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034936371] [2019-11-23 21:26:13,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:13,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 21:26:13,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:26:13,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:13,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:13,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:13,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-23 21:26:13,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:13,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:13,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:13,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-23 21:26:13,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:36 [2019-11-23 21:26:13,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:26:13,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:26:13,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:13,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:13,313 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-11-23 21:26:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:13,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:26:13,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-23 21:26:13,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670226350] [2019-11-23 21:26:13,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:26:13,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:13,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:26:13,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:26:13,319 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2019-11-23 21:26:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:26:13,527 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-11-23 21:26:13,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:26:13,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-23 21:26:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:26:13,529 INFO L225 Difference]: With dead ends: 59 [2019-11-23 21:26:13,529 INFO L226 Difference]: Without dead ends: 37 [2019-11-23 21:26:13,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:26:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-23 21:26:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-23 21:26:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-23 21:26:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-23 21:26:13,535 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2019-11-23 21:26:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:26:13,535 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-23 21:26:13,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:26:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-23 21:26:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 21:26:13,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:26:13,536 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:26:13,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:13,747 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:26:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:26:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2019-11-23 21:26:13,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:26:13,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380862357] [2019-11-23 21:26:13,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:26:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:14,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380862357] [2019-11-23 21:26:14,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979308088] [2019-11-23 21:26:14,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:26:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:26:14,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 21:26:14,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:26:14,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:26:14,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 21:26:14,140 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-11-23 21:26:14,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:26:14,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,295 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-11-23 21:26:14,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:14,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:14,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-23 21:26:14,368 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-23 21:26:14,394 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-23 21:26:14,414 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,427 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:111, output treesize:27 [2019-11-23 21:26:14,518 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:26:14,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,582 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_24|, |v_#memory_int_33|, |v_#memory_int_34|, |v_#memory_int_32|], 4=[|v_#memory_int_36|]} [2019-11-23 21:26:14,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:14,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,632 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:14,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,678 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:14,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,713 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:14,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:14,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:26:14,794 INFO L343 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2019-11-23 21:26:14,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2019-11-23 21:26:14,796 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:14,856 INFO L567 ElimStorePlain]: treesize reduction 18, result has 81.4 percent of original size [2019-11-23 21:26:14,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:14,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-11-23 21:26:14,866 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:249, output treesize:107 [2019-11-23 21:26:20,944 WARN L192 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 76 [2019-11-23 21:26:45,528 WARN L192 SmtUtils]: Spent 24.04 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-23 21:26:45,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:26:45,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-11-23 21:26:45,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:45,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:45,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-11-23 21:26:45,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:45,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:45,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-11-23 21:26:45,680 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:26:45,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:26:45,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:26:45,707 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 18 variables, input treesize:136, output treesize:3 [2019-11-23 21:26:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:26:45,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:26:45,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-23 21:26:45,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857278816] [2019-11-23 21:26:45,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:26:45,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:26:45,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:26:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:26:45,723 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 12 states. [2019-11-23 21:27:57,070 WARN L192 SmtUtils]: Spent 1.19 m on a formula simplification. DAG size of input: 116 DAG size of output: 87