/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/nr4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:52:33,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:52:33,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:52:33,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:52:33,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:52:33,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:52:33,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:52:33,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:52:33,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:52:33,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:52:33,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:52:33,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:52:33,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:52:33,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:52:33,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:52:33,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:52:33,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:52:33,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:52:33,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:52:33,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:52:33,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:52:33,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:52:33,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:52:33,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:52:33,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:52:33,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:52:33,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:52:33,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:52:33,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:52:33,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:52:33,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:52:33,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:52:33,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:52:33,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:52:33,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:52:33,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:52:33,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:52:33,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:52:33,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:52:33,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:52:33,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:52:33,413 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-06 18:52:33,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:52:33,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:52:33,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:52:33,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:52:33,429 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:52:33,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:52:33,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:52:33,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:52:33,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:52:33,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:52:33,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:52:33,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:52:33,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:52:33,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:52:33,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:52:33,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:52:33,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:52:33,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:52:33,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:52:33,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:52:33,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:52:33,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:52:33,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:52:33,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:52:33,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:52:33,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:52:33,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:52:33,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:52:33,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:52:33,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:52:33,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:52:33,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:52:33,732 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:52:33,732 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:52:33,733 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr4.c [2019-11-06 18:52:33,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1548ce3e6/b9dcaf00c7014debb5b8784984687aa6/FLAGf94b6c073 [2019-11-06 18:52:34,240 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:52:34,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr4.c [2019-11-06 18:52:34,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1548ce3e6/b9dcaf00c7014debb5b8784984687aa6/FLAGf94b6c073 [2019-11-06 18:52:34,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1548ce3e6/b9dcaf00c7014debb5b8784984687aa6 [2019-11-06 18:52:34,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:52:34,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:52:34,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:52:34,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:52:34,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:52:34,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:52:34" (1/1) ... [2019-11-06 18:52:34,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66cdbb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34, skipping insertion in model container [2019-11-06 18:52:34,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:52:34" (1/1) ... [2019-11-06 18:52:34,619 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:52:34,642 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:52:34,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:52:34,836 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:52:34,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:52:34,882 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:52:34,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34 WrapperNode [2019-11-06 18:52:34,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:52:34,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:52:34,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:52:34,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:52:34,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34" (1/1) ... [2019-11-06 18:52:34,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34" (1/1) ... [2019-11-06 18:52:34,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34" (1/1) ... [2019-11-06 18:52:34,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34" (1/1) ... [2019-11-06 18:52:34,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34" (1/1) ... [2019-11-06 18:52:35,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34" (1/1) ... [2019-11-06 18:52:35,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34" (1/1) ... [2019-11-06 18:52:35,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:52:35,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:52:35,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:52:35,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:52:35,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:52:35,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:52:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:52:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:52:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:52:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:52:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 18:52:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:52:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:52:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:52:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 18:52:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:52:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:52:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:52:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:52:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:52:35,377 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:52:35,377 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 18:52:35,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:52:35 BoogieIcfgContainer [2019-11-06 18:52:35,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:52:35,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:52:35,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:52:35,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:52:35,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:52:34" (1/3) ... [2019-11-06 18:52:35,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e90fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:52:35, skipping insertion in model container [2019-11-06 18:52:35,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:52:34" (2/3) ... [2019-11-06 18:52:35,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e90fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:52:35, skipping insertion in model container [2019-11-06 18:52:35,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:52:35" (3/3) ... [2019-11-06 18:52:35,389 INFO L109 eAbstractionObserver]: Analyzing ICFG nr4.c [2019-11-06 18:52:35,399 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:52:35,409 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:52:35,437 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:52:35,460 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:52:35,460 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:52:35,460 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:52:35,460 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:52:35,460 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:52:35,460 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:52:35,461 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:52:35,461 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:52:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-06 18:52:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:52:35,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:35,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:35,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:35,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-11-06 18:52:35,500 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:35,500 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513603170] [2019-11-06 18:52:35,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:35,738 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-06 18:52:35,738 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513603170] [2019-11-06 18:52:35,742 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:35,742 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 18:52:35,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026770399] [2019-11-06 18:52:35,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 18:52:35,750 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:35,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 18:52:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:52:35,764 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2019-11-06 18:52:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:36,007 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-11-06 18:52:36,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 18:52:36,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-06 18:52:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:36,020 INFO L225 Difference]: With dead ends: 60 [2019-11-06 18:52:36,020 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 18:52:36,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 18:52:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 18:52:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-06 18:52:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 18:52:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-06 18:52:36,072 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-11-06 18:52:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:36,072 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-06 18:52:36,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 18:52:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-06 18:52:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:52:36,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:36,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:36,075 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:36,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:36,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-11-06 18:52:36,076 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:36,076 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903928082] [2019-11-06 18:52:36,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:36,298 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903928082] [2019-11-06 18:52:36,301 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:36,301 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:52:36,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475900410] [2019-11-06 18:52:36,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:52:36,305 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:36,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:52:36,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:52:36,306 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-11-06 18:52:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:36,455 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-11-06 18:52:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:52:36,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 18:52:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:36,460 INFO L225 Difference]: With dead ends: 52 [2019-11-06 18:52:36,461 INFO L226 Difference]: Without dead ends: 35 [2019-11-06 18:52:36,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:52:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-06 18:52:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-06 18:52:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 18:52:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-06 18:52:36,482 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-11-06 18:52:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:36,482 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-06 18:52:36,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:52:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-06 18:52:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 18:52:36,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:36,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:36,486 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-11-06 18:52:36,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:36,488 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909368804] [2019-11-06 18:52:36,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:36,591 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909368804] [2019-11-06 18:52:36,592 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:36,592 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:52:36,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619715751] [2019-11-06 18:52:36,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:52:36,593 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:36,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:52:36,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:52:36,594 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-11-06 18:52:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:36,664 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-11-06 18:52:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:52:36,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-06 18:52:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:36,665 INFO L225 Difference]: With dead ends: 56 [2019-11-06 18:52:36,666 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 18:52:36,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:52:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 18:52:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-11-06 18:52:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 18:52:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-06 18:52:36,674 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-11-06 18:52:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:36,675 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-06 18:52:36,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:52:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-06 18:52:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 18:52:36,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:36,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:36,677 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:36,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:36,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-11-06 18:52:36,677 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:36,678 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193347659] [2019-11-06 18:52:36,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:36,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193347659] [2019-11-06 18:52:36,756 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:52:36,756 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:52:36,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674720357] [2019-11-06 18:52:36,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:52:36,757 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:52:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:52:36,760 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-11-06 18:52:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:36,855 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-06 18:52:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:52:36,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 18:52:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:36,856 INFO L225 Difference]: With dead ends: 57 [2019-11-06 18:52:36,856 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 18:52:36,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:52:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 18:52:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-06 18:52:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 18:52:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-06 18:52:36,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-11-06 18:52:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:36,870 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-06 18:52:36,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:52:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-06 18:52:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 18:52:36,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:36,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:36,873 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:36,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-11-06 18:52:36,874 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:36,874 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917297048] [2019-11-06 18:52:36,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:36,965 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-06 18:52:36,965 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917297048] [2019-11-06 18:52:36,965 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163090663] [2019-11-06 18:52:36,965 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-06 18:52:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 18:52:37,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:37,056 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-06 18:52:37,057 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:37,057 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-06 18:52:37,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741460478] [2019-11-06 18:52:37,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:52:37,058 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:37,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:52:37,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:52:37,059 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-11-06 18:52:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:37,151 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-11-06 18:52:37,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:52:37,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 18:52:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:37,153 INFO L225 Difference]: With dead ends: 61 [2019-11-06 18:52:37,153 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 18:52:37,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:52:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 18:52:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-11-06 18:52:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 18:52:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-06 18:52:37,161 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-11-06 18:52:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:37,162 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-06 18:52:37,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:52:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-06 18:52:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 18:52:37,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:37,163 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:37,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:37,367 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:37,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2019-11-06 18:52:37,368 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:37,368 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240242356] [2019-11-06 18:52:37,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:37,458 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240242356] [2019-11-06 18:52:37,458 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281204711] [2019-11-06 18:52:37,459 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-06 18:52:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:52:37,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:37,537 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:37,537 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-11-06 18:52:37,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863211040] [2019-11-06 18:52:37,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 18:52:37,538 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:37,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 18:52:37,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-06 18:52:37,539 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2019-11-06 18:52:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:37,651 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-11-06 18:52:37,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:52:37,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-06 18:52:37,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:37,652 INFO L225 Difference]: With dead ends: 63 [2019-11-06 18:52:37,652 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 18:52:37,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-06 18:52:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 18:52:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-06 18:52:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-06 18:52:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-06 18:52:37,660 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 25 [2019-11-06 18:52:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:37,660 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-06 18:52:37,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 18:52:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-06 18:52:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 18:52:37,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:37,662 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:37,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:37,863 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:37,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1706774660, now seen corresponding path program 2 times [2019-11-06 18:52:37,864 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:37,864 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549280048] [2019-11-06 18:52:37,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:37,932 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549280048] [2019-11-06 18:52:37,933 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821721943] [2019-11-06 18:52:37,933 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:37,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:52:37,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:37,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:52:37,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:38,005 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:38,005 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-06 18:52:38,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436912487] [2019-11-06 18:52:38,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 18:52:38,006 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:38,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 18:52:38,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:52:38,008 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-11-06 18:52:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:38,092 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-11-06 18:52:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:52:38,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-06 18:52:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:38,094 INFO L225 Difference]: With dead ends: 67 [2019-11-06 18:52:38,094 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 18:52:38,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:52:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 18:52:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-11-06 18:52:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 18:52:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-06 18:52:38,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2019-11-06 18:52:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:38,115 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-06 18:52:38,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 18:52:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-06 18:52:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 18:52:38,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:38,116 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:38,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:38,321 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1405489790, now seen corresponding path program 2 times [2019-11-06 18:52:38,322 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:38,322 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490681615] [2019-11-06 18:52:38,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:38,393 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490681615] [2019-11-06 18:52:38,393 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499427166] [2019-11-06 18:52:38,393 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:38,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:52:38,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:38,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 18:52:38,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:38,507 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:38,507 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-11-06 18:52:38,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295150311] [2019-11-06 18:52:38,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 18:52:38,508 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:38,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 18:52:38,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-06 18:52:38,509 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 10 states. [2019-11-06 18:52:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:38,623 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-06 18:52:38,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 18:52:38,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-06 18:52:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:38,624 INFO L225 Difference]: With dead ends: 70 [2019-11-06 18:52:38,624 INFO L226 Difference]: Without dead ends: 41 [2019-11-06 18:52:38,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-06 18:52:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-06 18:52:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-06 18:52:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 18:52:38,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-06 18:52:38,631 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-11-06 18:52:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:38,632 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-06 18:52:38,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 18:52:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-06 18:52:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 18:52:38,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:38,633 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:38,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:38,834 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:38,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1147324352, now seen corresponding path program 3 times [2019-11-06 18:52:38,836 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:38,836 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044457477] [2019-11-06 18:52:38,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:38,899 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044457477] [2019-11-06 18:52:38,899 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622379342] [2019-11-06 18:52:38,900 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:38,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 18:52:38,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:38,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 18:52:38,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 18:52:38,964 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:38,964 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-11-06 18:52:38,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226287700] [2019-11-06 18:52:38,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 18:52:38,965 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:38,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 18:52:38,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 18:52:38,966 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 8 states. [2019-11-06 18:52:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:39,107 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-06 18:52:39,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 18:52:39,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-11-06 18:52:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:39,108 INFO L225 Difference]: With dead ends: 71 [2019-11-06 18:52:39,108 INFO L226 Difference]: Without dead ends: 41 [2019-11-06 18:52:39,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-06 18:52:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-06 18:52:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-06 18:52:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 18:52:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-06 18:52:39,115 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2019-11-06 18:52:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:39,116 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-06 18:52:39,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 18:52:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-06 18:52:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 18:52:39,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:39,117 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:39,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:39,320 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash 401597370, now seen corresponding path program 3 times [2019-11-06 18:52:39,321 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:39,322 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320227035] [2019-11-06 18:52:39,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:39,919 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320227035] [2019-11-06 18:52:39,919 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462758311] [2019-11-06 18:52:39,919 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:39,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-06 18:52:39,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:39,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-06 18:52:39,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:40,032 INFO L375 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 18 treesize of output 14 [2019-11-06 18:52:40,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:40,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:40,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:40,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-06 18:52:40,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:40,122 INFO L375 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 31 treesize of output 30 [2019-11-06 18:52:40,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:40,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:40,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:52:40,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-06 18:52:40,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:40,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:40,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 143 [2019-11-06 18:52:40,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:40,269 INFO L567 ElimStorePlain]: treesize reduction 96, result has 35.6 percent of original size [2019-11-06 18:52:40,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:52:40,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2019-11-06 18:52:40,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:40,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:40,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 192 [2019-11-06 18:52:40,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:40,492 INFO L567 ElimStorePlain]: treesize reduction 102, result has 48.2 percent of original size [2019-11-06 18:52:40,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:40,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:40,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:52:40,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:64 [2019-11-06 18:52:40,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:40,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:40,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:40,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:40,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:40,749 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-06 18:52:40,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:52:40,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:40,919 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:40,920 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2019-11-06 18:52:40,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029849523] [2019-11-06 18:52:40,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-06 18:52:40,921 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:40,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-06 18:52:40,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-11-06 18:52:40,922 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 25 states. [2019-11-06 18:52:41,784 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-06 18:52:44,062 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-11-06 18:52:46,309 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-11-06 18:52:48,833 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2019-11-06 18:52:49,163 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-06 18:52:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:49,436 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2019-11-06 18:52:49,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-06 18:52:49,437 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-11-06 18:52:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:49,440 INFO L225 Difference]: With dead ends: 111 [2019-11-06 18:52:49,440 INFO L226 Difference]: Without dead ends: 95 [2019-11-06 18:52:49,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=346, Invalid=1460, Unknown=0, NotChecked=0, Total=1806 [2019-11-06 18:52:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-06 18:52:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 43. [2019-11-06 18:52:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-06 18:52:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-06 18:52:49,455 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 31 [2019-11-06 18:52:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:49,455 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-06 18:52:49,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-06 18:52:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-06 18:52:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 18:52:49,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:49,457 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:49,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:49,661 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:49,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash 890139769, now seen corresponding path program 1 times [2019-11-06 18:52:49,662 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:49,662 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065203779] [2019-11-06 18:52:49,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:50,193 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065203779] [2019-11-06 18:52:50,193 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724291188] [2019-11-06 18:52:50,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:50,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 18:52:50,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:50,363 INFO L375 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 18 treesize of output 14 [2019-11-06 18:52:50,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:50,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:50,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:50,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-06 18:52:50,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:50,501 INFO L375 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 33 treesize of output 32 [2019-11-06 18:52:50,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:50,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:50,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 18:52:50,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2019-11-06 18:52:50,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:52:50,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:50,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 125 [2019-11-06 18:52:50,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:50,678 INFO L567 ElimStorePlain]: treesize reduction 54, result has 60.9 percent of original size [2019-11-06 18:52:50,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 18:52:50,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:84 [2019-11-06 18:52:50,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:50,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:51,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:51,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:51,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:51,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:52,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:52:52,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:52,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:52,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:52,934 WARN L191 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2019-11-06 18:52:52,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:52:53,005 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:53,005 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 30 [2019-11-06 18:52:53,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779828904] [2019-11-06 18:52:53,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-06 18:52:53,006 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:53,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-06 18:52:53,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-11-06 18:52:53,007 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 30 states. [2019-11-06 18:52:53,991 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-11-06 18:52:54,240 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-06 18:52:54,753 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-11-06 18:52:55,022 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-11-06 18:52:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:56,102 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2019-11-06 18:52:56,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-06 18:52:56,103 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2019-11-06 18:52:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:56,104 INFO L225 Difference]: With dead ends: 128 [2019-11-06 18:52:56,104 INFO L226 Difference]: Without dead ends: 112 [2019-11-06 18:52:56,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=445, Invalid=2525, Unknown=0, NotChecked=0, Total=2970 [2019-11-06 18:52:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-06 18:52:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 48. [2019-11-06 18:52:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-06 18:52:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-11-06 18:52:56,135 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 40 [2019-11-06 18:52:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:56,136 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-11-06 18:52:56,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-06 18:52:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-11-06 18:52:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 18:52:56,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:56,142 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:56,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:56,346 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1944237414, now seen corresponding path program 2 times [2019-11-06 18:52:56,346 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:56,347 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718160178] [2019-11-06 18:52:56,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:52:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:52:56,659 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718160178] [2019-11-06 18:52:56,659 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147707896] [2019-11-06 18:52:56,659 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:56,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:52:56,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:52:56,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-06 18:52:56,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:52:56,909 INFO L375 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 16 treesize of output 12 [2019-11-06 18:52:56,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:56,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:56,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:52:56,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:52:56,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:52:56,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 57 [2019-11-06 18:52:56,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:52:56,990 INFO L567 ElimStorePlain]: treesize reduction 21, result has 65.0 percent of original size [2019-11-06 18:52:56,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:56,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:52:56,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:39 [2019-11-06 18:52:56,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:52:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:52:57,688 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:52:57,689 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2019-11-06 18:52:57,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388299681] [2019-11-06 18:52:57,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-06 18:52:57,690 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:52:57,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-06 18:52:57,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-11-06 18:52:57,691 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 30 states. [2019-11-06 18:52:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:52:59,692 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2019-11-06 18:52:59,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-06 18:52:59,693 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 49 [2019-11-06 18:52:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:52:59,694 INFO L225 Difference]: With dead ends: 129 [2019-11-06 18:52:59,694 INFO L226 Difference]: Without dead ends: 113 [2019-11-06 18:52:59,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=395, Invalid=2685, Unknown=0, NotChecked=0, Total=3080 [2019-11-06 18:52:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-06 18:52:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2019-11-06 18:52:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-06 18:52:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2019-11-06 18:52:59,725 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 49 [2019-11-06 18:52:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:52:59,725 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2019-11-06 18:52:59,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-06 18:52:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2019-11-06 18:52:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 18:52:59,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:52:59,730 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:52:59,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:52:59,944 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:52:59,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:52:59,945 INFO L82 PathProgramCache]: Analyzing trace with hash 651610521, now seen corresponding path program 3 times [2019-11-06 18:52:59,946 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:52:59,946 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937856990] [2019-11-06 18:52:59,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:52:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:00,219 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937856990] [2019-11-06 18:53:00,219 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584899657] [2019-11-06 18:53:00,219 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:00,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-06 18:53:00,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:00,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-06 18:53:00,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:00,367 INFO L375 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 18 treesize of output 14 [2019-11-06 18:53:00,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:00,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:00,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:00,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-06 18:53:00,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:53:00,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:00,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:01,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 28 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:53:01,540 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:01,540 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2019-11-06 18:53:01,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234900673] [2019-11-06 18:53:01,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-06 18:53:01,541 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-06 18:53:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 18:53:01,546 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 35 states. [2019-11-06 18:53:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:03,861 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2019-11-06 18:53:03,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-06 18:53:03,861 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 58 [2019-11-06 18:53:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:03,862 INFO L225 Difference]: With dead ends: 101 [2019-11-06 18:53:03,862 INFO L226 Difference]: Without dead ends: 68 [2019-11-06 18:53:03,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=442, Invalid=3218, Unknown=0, NotChecked=0, Total=3660 [2019-11-06 18:53:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-06 18:53:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-11-06 18:53:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-06 18:53:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-11-06 18:53:03,874 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 58 [2019-11-06 18:53:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:03,875 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-11-06 18:53:03,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-06 18:53:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-11-06 18:53:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-06 18:53:03,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:03,878 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:04,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:04,082 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash -27586745, now seen corresponding path program 4 times [2019-11-06 18:53:04,083 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:04,083 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433787838] [2019-11-06 18:53:04,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 7 proven. 113 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:04,657 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433787838] [2019-11-06 18:53:04,658 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870722227] [2019-11-06 18:53:04,658 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:04,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 18:53:04,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:04,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 18:53:04,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:04,870 INFO L375 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 18 treesize of output 14 [2019-11-06 18:53:04,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:04,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:04,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:04,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-06 18:53:04,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:04,972 INFO L375 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 31 treesize of output 30 [2019-11-06 18:53:04,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:04,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:04,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:53:05,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-06 18:53:05,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:05,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:05,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:05,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 87 [2019-11-06 18:53:05,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:05,297 INFO L567 ElimStorePlain]: treesize reduction 29, result has 69.8 percent of original size [2019-11-06 18:53:05,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:05,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:53:05,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:67 [2019-11-06 18:53:05,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:07,371 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-06 18:53:07,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms