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/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:57:26,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:57:26,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:57:26,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:57:26,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:57:26,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:57:26,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:57:26,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:57:26,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:57:26,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:57:26,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:57:26,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:57:26,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:57:26,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:57:26,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:57:26,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:57:26,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:57:26,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:57:26,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:57:26,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:57:26,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:57:26,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:57:26,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:57:26,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:57:26,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:57:26,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:57:26,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:57:26,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:57:26,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:57:26,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:57:26,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:57:26,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:57:26,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:57:26,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:57:26,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:57:26,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:57:26,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:57:26,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:57:26,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:57:26,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:57:26,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:57:26,915 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-09-20 12:57:26,934 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:57:26,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:57:26,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:57:26,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:57:26,936 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:57:26,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:57:26,936 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:57:26,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:57:26,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:57:26,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:57:26,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:57:26,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:57:26,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:57:26,938 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:57:26,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:57:26,938 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:57:26,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:57:26,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:57:26,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:57:26,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:57:26,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:57:26,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:57:26,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:57:26,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:57:26,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:57:26,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:57:26,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:57:26,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:57:26,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:57:26,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:57:26,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:57:26,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:57:26,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:57:26,988 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:57:26,989 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2019-09-20 12:57:27,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff363b1f/c851f6b0f95445bb8c342df0059e3a3b/FLAGc26cd31d7 [2019-09-20 12:57:27,560 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:57:27,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2019-09-20 12:57:27,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff363b1f/c851f6b0f95445bb8c342df0059e3a3b/FLAGc26cd31d7 [2019-09-20 12:57:27,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff363b1f/c851f6b0f95445bb8c342df0059e3a3b [2019-09-20 12:57:27,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:57:27,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:57:27,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:57:27,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:57:27,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:57:27,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:57:27" (1/1) ... [2019-09-20 12:57:27,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45331fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:27, skipping insertion in model container [2019-09-20 12:57:27,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:57:27" (1/1) ... [2019-09-20 12:57:28,000 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:57:28,015 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:57:28,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:57:28,245 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:57:28,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:57:28,381 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:57:28,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28 WrapperNode [2019-09-20 12:57:28,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:57:28,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:57:28,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:57:28,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:57:28,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:57:28,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:57:28,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:57:28,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:57:28,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (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-09-20 12:57:28,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:57:28,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:57:28,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:57:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:57:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:57:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:57:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 12:57:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:57:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 12:57:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 12:57:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 12:57:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 12:57:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:57:28,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:57:28,760 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:57:28,760 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-20 12:57:28,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:57:28 BoogieIcfgContainer [2019-09-20 12:57:28,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:57:28,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:57:28,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:57:28,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:57:28,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:57:27" (1/3) ... [2019-09-20 12:57:28,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61321c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:57:28, skipping insertion in model container [2019-09-20 12:57:28,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (2/3) ... [2019-09-20 12:57:28,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61321c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:57:28, skipping insertion in model container [2019-09-20 12:57:28,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:57:28" (3/3) ... [2019-09-20 12:57:28,769 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2019-09-20 12:57:28,791 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:57:28,799 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:57:28,816 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:57:28,844 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:57:28,845 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:57:28,845 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:57:28,845 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:57:28,845 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:57:28,846 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:57:28,846 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:57:28,846 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:57:28,846 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:57:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-20 12:57:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 12:57:28,864 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:28,865 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:28,867 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:28,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-09-20 12:57:28,873 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:28,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:28,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:28,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:28,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:29,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:29,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:57:29,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:57:29,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:57:29,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:57:29,034 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-20 12:57:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,056 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-09-20 12:57:29,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:57:29,061 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-20 12:57:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,069 INFO L225 Difference]: With dead ends: 46 [2019-09-20 12:57:29,069 INFO L226 Difference]: Without dead ends: 22 [2019-09-20 12:57:29,072 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:57:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-20 12:57:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-20 12:57:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-20 12:57:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-20 12:57:29,110 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-09-20 12:57:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:29,111 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-20 12:57:29,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:57:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-20 12:57:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 12:57:29,112 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:29,113 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:29,113 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:29,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:29,114 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-09-20 12:57:29,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:29,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:29,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:29,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:57:29,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:57:29,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:57:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:57:29,307 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2019-09-20 12:57:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,398 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-20 12:57:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:57:29,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-20 12:57:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,400 INFO L225 Difference]: With dead ends: 34 [2019-09-20 12:57:29,400 INFO L226 Difference]: Without dead ends: 23 [2019-09-20 12:57:29,401 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:57:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-20 12:57:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-20 12:57:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-20 12:57:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-20 12:57:29,409 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-09-20 12:57:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:29,410 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-20 12:57:29,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:57:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-20 12:57:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 12:57:29,411 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:29,411 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:29,412 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2019-09-20 12:57:29,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:29,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:57:29,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:29,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:57:29,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:57:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:57:29,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:57:29,557 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2019-09-20 12:57:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,594 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-20 12:57:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:57:29,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 12:57:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,595 INFO L225 Difference]: With dead ends: 40 [2019-09-20 12:57:29,595 INFO L226 Difference]: Without dead ends: 25 [2019-09-20 12:57:29,596 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:57:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-20 12:57:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-20 12:57:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-20 12:57:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-20 12:57:29,603 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-09-20 12:57:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:29,603 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-20 12:57:29,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:57:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-20 12:57:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 12:57:29,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:29,605 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:29,605 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-09-20 12:57:29,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:29,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:57:29,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:29,756 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:29,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-20 12:57:29,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:29,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 12:57:29,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:29,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:29,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:29,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-20 12:57:29,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2019-09-20 12:57:29,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:30,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:30,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-09-20 12:57:30,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:30,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:30,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-20 12:57:30,109 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2019-09-20 12:57:30,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:57:30,219 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 12:57:30,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:30,261 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.8 percent of original size [2019-09-20 12:57:30,278 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:57:30,281 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2019-09-20 12:57:30,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:30,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:30,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:30,307 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:41 [2019-09-20 12:57:30,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:57:30,584 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:57:30,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-09-20 12:57:30,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:30,609 INFO L567 ElimStorePlain]: treesize reduction 7, result has 72.0 percent of original size [2019-09-20 12:57:30,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:30,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:7 [2019-09-20 12:57:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:57:30,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:30,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2019-09-20 12:57:30,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 12:57:30,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 12:57:30,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:57:30,677 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-09-20 12:57:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:31,396 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-09-20 12:57:31,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 12:57:31,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-09-20 12:57:31,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:31,399 INFO L225 Difference]: With dead ends: 57 [2019-09-20 12:57:31,400 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 12:57:31,401 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-09-20 12:57:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 12:57:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-09-20 12:57:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-20 12:57:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-20 12:57:31,420 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 19 [2019-09-20 12:57:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:31,420 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-20 12:57:31,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 12:57:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-20 12:57:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 12:57:31,422 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:31,422 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:31,423 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2019-09-20 12:57:31,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:31,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:31,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:31,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:57:31,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:31,706 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:57:31,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:31,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:57:31,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:31,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 12:57:31,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:31,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 12:57:31,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:31,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:31,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:31,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-09-20 12:57:31,931 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 12:57:31,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:31,940 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 46 treesize of output 45 [2019-09-20 12:57:31,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:31,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:31,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:31,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2019-09-20 12:57:32,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:57:32,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:57:32,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:32,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2019-09-20 12:57:32,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 12:57:32,202 INFO L567 ElimStorePlain]: treesize reduction 20, result has 52.4 percent of original size [2019-09-20 12:57:32,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:32,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2019-09-20 12:57:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:57:32,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:32,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2019-09-20 12:57:32,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-20 12:57:32,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-20 12:57:32,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-20 12:57:32,273 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 18 states. [2019-09-20 12:57:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:32,981 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-20 12:57:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:57:32,982 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2019-09-20 12:57:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:32,983 INFO L225 Difference]: With dead ends: 49 [2019-09-20 12:57:32,983 INFO L226 Difference]: Without dead ends: 31 [2019-09-20 12:57:32,984 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-09-20 12:57:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-20 12:57:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-20 12:57:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 12:57:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-20 12:57:32,990 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2019-09-20 12:57:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:32,991 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-20 12:57:32,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-20 12:57:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-20 12:57:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 12:57:32,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:32,992 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:32,992 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash 832058620, now seen corresponding path program 3 times [2019-09-20 12:57:32,993 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:32,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:32,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:57:33,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:33,201 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:33,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:57:33,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 12:57:33,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:33,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 12:57:33,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 12:57:33,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:33,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-20 12:57:33,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:57:33,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:57:33,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:57:33,324 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 11 states. [2019-09-20 12:57:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:33,632 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-09-20 12:57:33,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:57:33,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-09-20 12:57:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:33,634 INFO L225 Difference]: With dead ends: 58 [2019-09-20 12:57:33,634 INFO L226 Difference]: Without dead ends: 39 [2019-09-20 12:57:33,635 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-20 12:57:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-20 12:57:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2019-09-20 12:57:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-20 12:57:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-20 12:57:33,642 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 25 [2019-09-20 12:57:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:33,642 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-20 12:57:33,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:57:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-20 12:57:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 12:57:33,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:33,644 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:33,644 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash -194529672, now seen corresponding path program 4 times [2019-09-20 12:57:33,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:33,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:33,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:33,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:33,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 12:57:33,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:33,848 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:33,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 12:57:33,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:57:33,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:33,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-20 12:57:33,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:33,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 12:57:33,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:33,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:33,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:33,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-20 12:57:34,324 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 46 treesize of output 45 [2019-09-20 12:57:34,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:34,330 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 12:57:34,331 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:34,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:34,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:34,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2019-09-20 12:57:34,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:57:34,635 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:57:34,641 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:34,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2019-09-20 12:57:34,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 12:57:34,663 INFO L567 ElimStorePlain]: treesize reduction 20, result has 52.4 percent of original size [2019-09-20 12:57:34,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:34,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2019-09-20 12:57:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:57:34,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:34,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 26 [2019-09-20 12:57:34,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-20 12:57:34,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-20 12:57:34,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-20 12:57:34,742 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 26 states. [2019-09-20 12:57:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:36,741 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-20 12:57:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 12:57:36,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-09-20 12:57:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:36,744 INFO L225 Difference]: With dead ends: 67 [2019-09-20 12:57:36,745 INFO L226 Difference]: Without dead ends: 56 [2019-09-20 12:57:36,746 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2019-09-20 12:57:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-20 12:57:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2019-09-20 12:57:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-20 12:57:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-20 12:57:36,755 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2019-09-20 12:57:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:36,755 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-20 12:57:36,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-20 12:57:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-20 12:57:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:57:36,756 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:36,757 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:36,757 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2065498070, now seen corresponding path program 5 times [2019-09-20 12:57:36,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:36,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:36,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-20 12:57:36,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:36,867 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:36,899 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 12:57:36,951 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-20 12:57:36,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:36,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-20 12:57:36,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:36,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 12:57:36,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:36,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:36,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:36,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-20 12:57:37,382 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 49 treesize of output 48 [2019-09-20 12:57:37,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:37,386 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 12:57:37,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:37,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:37,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:37,404 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:45 [2019-09-20 12:57:37,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:57:37,655 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:57:37,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:57:37,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 10 [2019-09-20 12:57:37,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:37,678 INFO L567 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2019-09-20 12:57:37,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:37,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:3 [2019-09-20 12:57:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-20 12:57:37,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:37,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19] total 24 [2019-09-20 12:57:37,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-20 12:57:37,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-20 12:57:37,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-20 12:57:37,750 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 24 states. [2019-09-20 12:57:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:38,967 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-09-20 12:57:38,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-20 12:57:38,968 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-09-20 12:57:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:38,969 INFO L225 Difference]: With dead ends: 77 [2019-09-20 12:57:38,969 INFO L226 Difference]: Without dead ends: 54 [2019-09-20 12:57:38,970 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 12:57:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-20 12:57:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-09-20 12:57:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-20 12:57:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-09-20 12:57:38,980 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2019-09-20 12:57:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:38,981 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-09-20 12:57:38,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-20 12:57:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-09-20 12:57:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 12:57:38,982 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:38,982 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:38,983 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:38,983 INFO L82 PathProgramCache]: Analyzing trace with hash -64658350, now seen corresponding path program 6 times [2019-09-20 12:57:38,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:38,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:38,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:38,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-20 12:57:39,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:39,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 12:57:39,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:57:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:57:39,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:57:39,176 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 9 states. [2019-09-20 12:57:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:39,416 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2019-09-20 12:57:39,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:57:39,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-09-20 12:57:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:39,418 INFO L225 Difference]: With dead ends: 79 [2019-09-20 12:57:39,418 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 12:57:39,418 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-09-20 12:57:39,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 12:57:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2019-09-20 12:57:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-20 12:57:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-09-20 12:57:39,442 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2019-09-20 12:57:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:39,442 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-09-20 12:57:39,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:57:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-09-20 12:57:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-20 12:57:39,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:39,449 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:39,449 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:39,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash -90011861, now seen corresponding path program 1 times [2019-09-20 12:57:39,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:39,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:39,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-20 12:57:39,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:39,636 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:39,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:39,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-20 12:57:39,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:39,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 12:57:39,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:39,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:39,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:39,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-09-20 12:57:40,123 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 49 treesize of output 48 [2019-09-20 12:57:40,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:40,135 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 49 treesize of output 48 [2019-09-20 12:57:40,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:40,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:40,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-20 12:57:40,175 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:91 [2019-09-20 12:57:40,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:57:40,356 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 12:57:40,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:40,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:40,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:57:40,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:57:40,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2019-09-20 12:57:40,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:40,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:57:40,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:40,417 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:61 [2019-09-20 12:57:40,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:57:42,791 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (main_~max~0 Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (.cse0 (mod (+ main_~max~0 4294967295) 4294967296)) (.cse1 (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|))) (and (<= .cse0 4) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (= (select .cse1 4) (select .cse2 (+ .cse0 (- 4)))) (<= .cse0 2147483647) (<= 4 .cse0) (= (select .cse2 (+ .cse0 (- 3))) (select .cse1 3))))) is different from true [2019-09-20 12:57:44,835 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-20 12:57:46,908 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-09-20 12:57:47,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:57:47,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:57:47,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:57:47,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:57:47,176 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 12:57:47,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2019-09-20 12:57:47,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:57:47,202 INFO L567 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2019-09-20 12:57:47,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:57:47,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:3 [2019-09-20 12:57:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2019-09-20 12:57:49,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:49,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 27] total 33 [2019-09-20 12:57:49,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-20 12:57:49,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-20 12:57:49,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=900, Unknown=2, NotChecked=60, Total=1056 [2019-09-20 12:57:49,331 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 33 states. [2019-09-20 12:57:56,736 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-20 12:58:00,786 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-09-20 12:58:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:03,707 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-09-20 12:58:03,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-20 12:58:03,711 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2019-09-20 12:58:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:03,712 INFO L225 Difference]: With dead ends: 90 [2019-09-20 12:58:03,712 INFO L226 Difference]: Without dead ends: 61 [2019-09-20 12:58:03,713 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=218, Invalid=1945, Unknown=3, NotChecked=90, Total=2256 [2019-09-20 12:58:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-20 12:58:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-09-20 12:58:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-20 12:58:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-20 12:58:03,724 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 41 [2019-09-20 12:58:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:03,724 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-20 12:58:03,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-20 12:58:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-20 12:58:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 12:58:03,726 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:03,726 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:03,726 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:03,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash -480781312, now seen corresponding path program 2 times [2019-09-20 12:58:03,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:03,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:04,357 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-20 12:58:04,520 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-20 12:58:04,671 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-20 12:58:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-20 12:58:05,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:05,374 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:05,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:58:05,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:05,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:05,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-20 12:58:05,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:05,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-20 12:58:05,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:58:05,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:58:05,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:58:05,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-20 12:58:05,831 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 57 treesize of output 56 [2019-09-20 12:58:05,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:58:05,839 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 58 treesize of output 57 [2019-09-20 12:58:05,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:58:05,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:58:05,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-20 12:58:05,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:116, output treesize:108 [2019-09-20 12:58:06,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:06,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 77 [2019-09-20 12:58:06,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:58:06,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:58:06,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 78 [2019-09-20 12:58:06,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:58:06,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:58:06,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-09-20 12:58:06,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:146, output treesize:138 [2019-09-20 12:58:06,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:06,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:58:06,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 103 [2019-09-20 12:58:06,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:58:06,561 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 12:58:06,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 12:58:06,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:58:06,590 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-09-20 12:58:06,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:184, output treesize:88 [2019-09-20 12:58:07,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:09,280 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_2| Int) (main_~max~0 Int) (v_main_~j~0_31 Int) (|v_main_~#str1~0.base_BEFORE_CALL_2| Int)) (let ((.cse5 (+ main_~max~0 4294967295))) (let ((.cse6 (div .cse5 4294967296))) (let ((.cse2 (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_2|)) (.cse0 (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_2|)) (.cse1 (* (- 4294967296) .cse6)) (.cse4 (+ main_~max~0 4294967291)) (.cse3 (* 4294967296 .cse6))) (and (= (select .cse0 (+ main_~max~0 .cse1 4294967292)) (select .cse2 3)) (= (select .cse0 (+ main_~max~0 .cse1 4294967293)) (select .cse2 2)) (<= 4 v_main_~j~0_31) (= (select .cse2 v_main_~j~0_31) (select .cse0 (+ main_~max~0 .cse1 4294967291))) (<= .cse3 .cse4) (not (= |v_main_~#str2~0.base_BEFORE_CALL_2| |v_main_~#str1~0.base_BEFORE_CALL_2|)) (<= (mod .cse5 4294967296) 2147483647) (<= .cse4 .cse3)))))) is different from true [2019-09-20 12:58:11,364 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 47