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-f4eb214f-m [2019-10-13 19:17:18,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:17:18,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:17:18,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:17:18,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:17:18,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:17:18,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:17:18,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:17:18,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:17:18,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:17:18,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:17:18,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:17:18,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:17:18,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:17:18,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:17:18,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:17:18,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:17:18,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:17:18,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:17:18,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:17:18,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:17:18,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:17:18,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:17:18,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:17:18,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:17:18,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:17:18,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:17:18,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:17:18,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:17:18,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:17:18,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:17:18,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:17:18,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:17:18,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:17:18,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:17:18,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:17:18,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:17:18,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:17:18,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:17:18,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:17:18,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:17:18,516 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-10-13 19:17:18,545 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:17:18,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:17:18,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:17:18,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:17:18,549 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:17:18,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:17:18,549 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:17:18,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:17:18,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:17:18,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:17:18,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:17:18,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:17:18,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:17:18,552 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:17:18,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:17:18,552 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:17:18,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:17:18,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:17:18,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:17:18,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:17:18,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:17:18,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:17:18,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:17:18,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:17:18,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:17:18,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:17:18,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:17:18,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:17:18,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:17:18,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:17:18,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:17:18,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:17:18,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:17:18,890 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:17:18,891 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-10-13 19:17:18,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203ebfcd3/801c3a0b0b6f41169639ad8a094e8130/FLAGf5a6e8200 [2019-10-13 19:17:19,420 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:17:19,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2019-10-13 19:17:19,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203ebfcd3/801c3a0b0b6f41169639ad8a094e8130/FLAGf5a6e8200 [2019-10-13 19:17:19,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203ebfcd3/801c3a0b0b6f41169639ad8a094e8130 [2019-10-13 19:17:19,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:17:19,837 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:17:19,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:17:19,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:17:19,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:17:19,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:17:19" (1/1) ... [2019-10-13 19:17:19,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a425a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:19, skipping insertion in model container [2019-10-13 19:17:19,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:17:19" (1/1) ... [2019-10-13 19:17:19,853 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:17:19,872 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:17:20,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:17:20,078 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:17:20,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:17:20,198 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:17:20,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20 WrapperNode [2019-10-13 19:17:20,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:17:20,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:17:20,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:17:20,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:17:20,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20" (1/1) ... [2019-10-13 19:17:20,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20" (1/1) ... [2019-10-13 19:17:20,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20" (1/1) ... [2019-10-13 19:17:20,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20" (1/1) ... [2019-10-13 19:17:20,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20" (1/1) ... [2019-10-13 19:17:20,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20" (1/1) ... [2019-10-13 19:17:20,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20" (1/1) ... [2019-10-13 19:17:20,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:17:20,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:17:20,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:17:20,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:17:20,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20" (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-10-13 19:17:20,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:17:20,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:17:20,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 19:17:20,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:17:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:17:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 19:17:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:17:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:17:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 19:17:20,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 19:17:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 19:17:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:17:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:17:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:17:20,606 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:17:20,609 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 19:17:20,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:17:20 BoogieIcfgContainer [2019-10-13 19:17:20,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:17:20,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:17:20,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:17:20,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:17:20,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:17:19" (1/3) ... [2019-10-13 19:17:20,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a760a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:17:20, skipping insertion in model container [2019-10-13 19:17:20,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:17:20" (2/3) ... [2019-10-13 19:17:20,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a760a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:17:20, skipping insertion in model container [2019-10-13 19:17:20,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:17:20" (3/3) ... [2019-10-13 19:17:20,628 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2019-10-13 19:17:20,638 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:17:20,645 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:17:20,655 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:17:20,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:17:20,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:17:20,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:17:20,678 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:17:20,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:17:20,678 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:17:20,678 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:17:20,678 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:17:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-13 19:17:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 19:17:20,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:20,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:20,700 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-10-13 19:17:20,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:20,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370407144] [2019-10-13 19:17:20,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:20,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:20,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:17:20,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370407144] [2019-10-13 19:17:20,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:17:20,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:17:20,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206726584] [2019-10-13 19:17:20,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:17:20,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:20,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:17:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:17:20,926 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-10-13 19:17:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:21,018 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-10-13 19:17:21,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:17:21,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 19:17:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:21,029 INFO L225 Difference]: With dead ends: 46 [2019-10-13 19:17:21,029 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 19:17:21,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:17:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 19:17:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 19:17:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 19:17:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-13 19:17:21,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-13 19:17:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:21,074 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-13 19:17:21,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:17:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-13 19:17:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 19:17:21,076 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:21,076 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:21,076 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:21,077 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-10-13 19:17:21,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:21,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887305334] [2019-10-13 19:17:21,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:21,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:21,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:17:21,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887305334] [2019-10-13 19:17:21,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:17:21,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:17:21,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418607077] [2019-10-13 19:17:21,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:17:21,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:17:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:17:21,301 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-10-13 19:17:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:21,412 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-10-13 19:17:21,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:17:21,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 19:17:21,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:21,415 INFO L225 Difference]: With dead ends: 34 [2019-10-13 19:17:21,415 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 19:17:21,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:17:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 19:17:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-13 19:17:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 19:17:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-13 19:17:21,425 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-10-13 19:17:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:21,425 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-13 19:17:21,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:17:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-13 19:17:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:17:21,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:21,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:21,426 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2019-10-13 19:17:21,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:21,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699368604] [2019-10-13 19:17:21,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:21,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:21,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:17:21,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699368604] [2019-10-13 19:17:21,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:17:21,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:17:21,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213297079] [2019-10-13 19:17:21,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:17:21,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:21,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:17:21,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:17:21,601 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 4 states. [2019-10-13 19:17:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:21,686 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-13 19:17:21,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:17:21,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-13 19:17:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:21,687 INFO L225 Difference]: With dead ends: 40 [2019-10-13 19:17:21,688 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 19:17:21,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:17:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 19:17:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-13 19:17:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 19:17:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 19:17:21,695 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-13 19:17:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:21,696 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 19:17:21,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:17:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 19:17:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:17:21,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:21,697 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:21,697 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:21,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:21,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-10-13 19:17:21,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:21,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984193249] [2019-10-13 19:17:21,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:21,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:21,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:17:21,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984193249] [2019-10-13 19:17:21,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166123690] [2019-10-13 19:17:21,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:21,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 19:17:21,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:21,986 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-10-13 19:17:21,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:21,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:21,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:21,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-13 19:17:22,029 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-10-13 19:17:22,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:22,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:22,086 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-10-13 19:17:22,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:22,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:22,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:17:22,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2019-10-13 19:17:22,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:22,238 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 19:17:22,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:22,279 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.8 percent of original size [2019-10-13 19:17:22,296 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:17:22,299 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-10-13 19:17:22,300 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:22,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:22,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:22,318 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:41 [2019-10-13 19:17:22,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:22,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:17:22,569 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-10-13 19:17:22,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:22,593 INFO L567 ElimStorePlain]: treesize reduction 7, result has 72.0 percent of original size [2019-10-13 19:17:22,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:22,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:7 [2019-10-13 19:17:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:17:22,655 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:22,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2019-10-13 19:17:22,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070430830] [2019-10-13 19:17:22,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 19:17:22,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 19:17:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:17:22,658 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 15 states. [2019-10-13 19:17:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:23,466 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-10-13 19:17:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:17:23,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-10-13 19:17:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:23,471 INFO L225 Difference]: With dead ends: 57 [2019-10-13 19:17:23,471 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 19:17:23,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-10-13 19:17:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 19:17:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-10-13 19:17:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 19:17:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-10-13 19:17:23,505 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 19 [2019-10-13 19:17:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:23,505 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-10-13 19:17:23,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 19:17:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-10-13 19:17:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:17:23,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:23,510 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:23,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:23,717 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2019-10-13 19:17:23,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:23,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211169922] [2019-10-13 19:17:23,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:23,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:23,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 19:17:23,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211169922] [2019-10-13 19:17:23,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171745370] [2019-10-13 19:17:23,989 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:24,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:17:24,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:24,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-13 19:17:24,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:24,080 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-10-13 19:17:24,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:24,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:24,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:24,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-10-13 19:17:24,224 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 19:17:24,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:24,230 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-10-13 19:17:24,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:24,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:24,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:24,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2019-10-13 19:17:24,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:24,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:17:24,516 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:24,517 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-10-13 19:17:24,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 19:17:24,543 INFO L567 ElimStorePlain]: treesize reduction 20, result has 52.4 percent of original size [2019-10-13 19:17:24,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:24,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2019-10-13 19:17:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 19:17:24,614 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:24,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2019-10-13 19:17:24,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852138243] [2019-10-13 19:17:24,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 19:17:24,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:24,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 19:17:24,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:17:24,616 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 19 states. [2019-10-13 19:17:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:25,427 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-10-13 19:17:25,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:17:25,428 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-10-13 19:17:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:25,429 INFO L225 Difference]: With dead ends: 49 [2019-10-13 19:17:25,429 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 19:17:25,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-10-13 19:17:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 19:17:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-13 19:17:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 19:17:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-13 19:17:25,437 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2019-10-13 19:17:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:25,437 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-13 19:17:25,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 19:17:25,437 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-13 19:17:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:17:25,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:25,438 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:25,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:25,643 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:25,644 INFO L82 PathProgramCache]: Analyzing trace with hash 832058620, now seen corresponding path program 3 times [2019-10-13 19:17:25,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:25,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578072391] [2019-10-13 19:17:25,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:25,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:25,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 19:17:25,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578072391] [2019-10-13 19:17:25,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239132342] [2019-10-13 19:17:25,894 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:25,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 19:17:25,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:25,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 19:17:25,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 19:17:26,000 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:26,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-13 19:17:26,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349038918] [2019-10-13 19:17:26,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:17:26,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:26,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:17:26,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:17:26,003 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2019-10-13 19:17:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:26,400 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-10-13 19:17:26,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:17:26,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-10-13 19:17:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:26,402 INFO L225 Difference]: With dead ends: 58 [2019-10-13 19:17:26,402 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 19:17:26,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:17:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 19:17:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2019-10-13 19:17:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 19:17:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-10-13 19:17:26,417 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 25 [2019-10-13 19:17:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:26,417 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-10-13 19:17:26,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:17:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-10-13 19:17:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:17:26,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:26,418 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:26,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:26,630 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash -194529672, now seen corresponding path program 4 times [2019-10-13 19:17:26,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:26,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144197053] [2019-10-13 19:17:26,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:26,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:26,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 19:17:27,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144197053] [2019-10-13 19:17:27,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116432649] [2019-10-13 19:17:27,086 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:27,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 19:17:27,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:27,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-13 19:17:27,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:27,151 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-10-13 19:17:27,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:27,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:27,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:27,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-13 19:17:27,614 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-10-13 19:17:27,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:27,621 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 19:17:27,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:27,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:27,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:27,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2019-10-13 19:17:27,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:27,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:17:27,946 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:27,947 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-10-13 19:17:27,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 19:17:27,967 INFO L567 ElimStorePlain]: treesize reduction 20, result has 52.4 percent of original size [2019-10-13 19:17:27,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:27,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2019-10-13 19:17:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:17:28,039 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:28,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 27 [2019-10-13 19:17:28,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261867985] [2019-10-13 19:17:28,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 19:17:28,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:28,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 19:17:28,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2019-10-13 19:17:28,041 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 27 states. [2019-10-13 19:17:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:30,085 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-10-13 19:17:30,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 19:17:30,091 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2019-10-13 19:17:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:30,092 INFO L225 Difference]: With dead ends: 67 [2019-10-13 19:17:30,092 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 19:17:30,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=246, Invalid=1646, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 19:17:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 19:17:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2019-10-13 19:17:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 19:17:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-13 19:17:30,102 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2019-10-13 19:17:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:30,103 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-13 19:17:30,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 19:17:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-13 19:17:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:17:30,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:30,104 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:30,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:30,308 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:30,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2065498070, now seen corresponding path program 5 times [2019-10-13 19:17:30,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:30,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528317950] [2019-10-13 19:17:30,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:30,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:30,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 19:17:30,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528317950] [2019-10-13 19:17:30,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101601808] [2019-10-13 19:17:30,455 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:30,524 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-13 19:17:30,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:30,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-13 19:17:30,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:30,535 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-10-13 19:17:30,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:30,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:30,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:30,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-13 19:17:30,981 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-10-13 19:17:30,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:30,987 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 19:17:30,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:31,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:31,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:31,007 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:45 [2019-10-13 19:17:31,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:31,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:17:31,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:17:31,268 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-10-13 19:17:31,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:31,284 INFO L567 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2019-10-13 19:17:31,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:31,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:3 [2019-10-13 19:17:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 19:17:31,358 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:31,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 25 [2019-10-13 19:17:31,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915534580] [2019-10-13 19:17:31,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 19:17:31,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:31,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 19:17:31,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-10-13 19:17:31,360 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 25 states. [2019-10-13 19:17:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:32,601 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-10-13 19:17:32,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 19:17:32,603 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-10-13 19:17:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:32,604 INFO L225 Difference]: With dead ends: 77 [2019-10-13 19:17:32,604 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 19:17:32,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 19:17:32,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 19:17:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-10-13 19:17:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-13 19:17:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-10-13 19:17:32,614 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2019-10-13 19:17:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:32,614 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-10-13 19:17:32,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 19:17:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-10-13 19:17:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:17:32,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:32,616 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:17:32,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:32,820 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:32,821 INFO L82 PathProgramCache]: Analyzing trace with hash -64658350, now seen corresponding path program 6 times [2019-10-13 19:17:32,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:32,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979976389] [2019-10-13 19:17:32,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:32,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:32,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 19:17:33,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979976389] [2019-10-13 19:17:33,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:17:33,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:17:33,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932850715] [2019-10-13 19:17:33,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:17:33,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:17:33,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:17:33,051 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 10 states. [2019-10-13 19:17:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:33,362 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2019-10-13 19:17:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:17:33,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-10-13 19:17:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:33,364 INFO L225 Difference]: With dead ends: 79 [2019-10-13 19:17:33,364 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 19:17:33,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:17:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 19:17:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2019-10-13 19:17:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 19:17:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-10-13 19:17:33,373 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2019-10-13 19:17:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:33,373 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-10-13 19:17:33,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:17:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-10-13 19:17:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 19:17:33,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:33,375 INFO L380 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-10-13 19:17:33,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash -90011861, now seen corresponding path program 1 times [2019-10-13 19:17:33,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:33,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041744223] [2019-10-13 19:17:33,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:33,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:33,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 19:17:33,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041744223] [2019-10-13 19:17:33,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646627290] [2019-10-13 19:17:33,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:33,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-13 19:17:33,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:33,582 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-10-13 19:17:33,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:33,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:33,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:33,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-13 19:17:33,986 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-10-13 19:17:33,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:33,992 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-10-13 19:17:33,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:34,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:34,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:17:34,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:91 [2019-10-13 19:17:34,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:34,195 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 19:17:34,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:34,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:34,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:34,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:34,222 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-10-13 19:17:34,223 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:34,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:34,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:34,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:61 [2019-10-13 19:17:34,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:36,587 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-10-13 19:17:38,626 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2019-10-13 19:17:40,678 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-10-13 19:17:40,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:40,957 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:17:40,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:40,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:40,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:17:40,963 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-10-13 19:17:40,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:40,982 INFO L567 ElimStorePlain]: treesize reduction 7, result has 75.9 percent of original size [2019-10-13 19:17:40,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:40,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:3 [2019-10-13 19:17:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2019-10-13 19:17:43,084 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:17:43,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 27] total 34 [2019-10-13 19:17:43,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337032189] [2019-10-13 19:17:43,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-13 19:17:43,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:17:43,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-13 19:17:43,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=962, Unknown=2, NotChecked=62, Total=1122 [2019-10-13 19:17:43,087 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 34 states. [2019-10-13 19:17:48,599 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-10-13 19:17:52,674 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-13 19:17:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:17:55,688 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-10-13 19:17:55,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 19:17:55,688 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-10-13 19:17:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:17:55,689 INFO L225 Difference]: With dead ends: 90 [2019-10-13 19:17:55,689 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 19:17:55,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=222, Invalid=2036, Unknown=2, NotChecked=92, Total=2352 [2019-10-13 19:17:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 19:17:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-10-13 19:17:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 19:17:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-10-13 19:17:55,711 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 41 [2019-10-13 19:17:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:17:55,712 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-10-13 19:17:55,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-13 19:17:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-10-13 19:17:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 19:17:55,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:17:55,716 INFO L380 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-10-13 19:17:55,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:55,918 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:17:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:17:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash -480781312, now seen corresponding path program 2 times [2019-10-13 19:17:55,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:17:55,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698530174] [2019-10-13 19:17:55,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:55,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:17:55,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:17:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:56,526 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-10-13 19:17:56,673 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-10-13 19:17:56,808 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-13 19:17:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:17:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 19:17:57,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698530174] [2019-10-13 19:17:57,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166101138] [2019-10-13 19:17:57,550 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:17:57,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:17:57,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:17:57,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-13 19:17:57,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:17:57,643 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-10-13 19:17:57,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:57,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:57,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:17:57,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-13 19:17:58,176 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-10-13 19:17:58,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:58,183 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-10-13 19:17:58,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:58,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:58,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:17:58,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:116, output treesize:108 [2019-10-13 19:17:58,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:58,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,493 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-10-13 19:17:58,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:58,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:58,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,554 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-10-13 19:17:58,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:58,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:58,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:17:58,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:146, output treesize:138 [2019-10-13 19:17:58,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:17:58,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:17:58,966 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-10-13 19:17:58,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:58,971 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 19:17:58,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:17:58,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:17:58,998 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-10-13 19:17:58,998 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:184, output treesize:88 [2019-10-13 19:17:59,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:18:01,591 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 ((.cse4 (+ main_~max~0 4294967291)) (.cse3 (* 4294967296 .cse6)) (.cse0 (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_2|)) (.cse1 (* .cse6 (- 4294967296))) (.cse2 (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_2|))) (and (= (select .cse0 (+ main_~max~0 .cse1 4294967293)) (select .cse2 2)) (<= 4 v_main_~j~0_31) (= (select .cse0 (+ main_~max~0 .cse1 4294967291)) (select .cse2 v_main_~j~0_31)) (<= .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) (= (select .cse0 (+ main_~max~0 .cse1 4294967292)) (select .cse2 3))))))) is different from true [2019-10-13 19:18:03,685 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47