java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:50:33,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:50:33,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:50:33,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:50:33,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:50:33,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:50:33,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:50:33,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:50:33,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:50:33,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:50:33,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:50:33,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:50:33,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:50:33,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:50:33,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:50:33,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:50:33,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:50:33,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:50:33,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:50:33,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:50:33,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:50:33,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:50:33,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:50:33,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:50:33,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:50:33,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:50:33,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:50:33,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:50:33,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:50:33,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:50:33,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:50:33,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:50:33,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:50:33,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:50:33,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:50:33,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:50:33,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:50:33,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:50:33,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:50:33,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:50:33,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:50:33,902 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-14 21:50:33,935 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:50:33,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:50:33,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:50:33,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:50:33,937 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:50:33,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:50:33,941 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:50:33,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:50:33,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:50:33,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:50:33,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:50:33,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:50:33,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:50:33,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:50:33,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:50:33,942 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:50:33,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:50:33,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:50:33,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:50:33,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:50:33,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:50:33,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:33,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:50:33,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:50:33,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:50:33,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:50:33,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:50:33,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:50:33,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:50:34,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:50:34,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:50:34,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:50:34,218 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:50:34,218 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:50:34,219 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c [2019-10-14 21:50:34,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc001ba03/d8ea3c2f37574064ad40af7779d7d190/FLAG3d34eef54 [2019-10-14 21:50:34,666 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:50:34,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c [2019-10-14 21:50:34,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc001ba03/d8ea3c2f37574064ad40af7779d7d190/FLAG3d34eef54 [2019-10-14 21:50:35,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc001ba03/d8ea3c2f37574064ad40af7779d7d190 [2019-10-14 21:50:35,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:50:35,104 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:50:35,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:35,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:50:35,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:50:35,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:35" (1/1) ... [2019-10-14 21:50:35,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573a9846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35, skipping insertion in model container [2019-10-14 21:50:35,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:35" (1/1) ... [2019-10-14 21:50:35,119 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:50:35,138 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:50:35,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:35,369 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:50:35,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:35,500 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:50:35,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35 WrapperNode [2019-10-14 21:50:35,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:35,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:50:35,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:50:35,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:50:35,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35" (1/1) ... [2019-10-14 21:50:35,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35" (1/1) ... [2019-10-14 21:50:35,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35" (1/1) ... [2019-10-14 21:50:35,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35" (1/1) ... [2019-10-14 21:50:35,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35" (1/1) ... [2019-10-14 21:50:35,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35" (1/1) ... [2019-10-14 21:50:35,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35" (1/1) ... [2019-10-14 21:50:35,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:50:35,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:50:35,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:50:35,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:50:35,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35" (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-14 21:50:35,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:50:35,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:50:35,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:50:35,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:50:35,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:50:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:50:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:50:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:50:35,606 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 21:50:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:50:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 21:50:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:50:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:50:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:50:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:50:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:50:35,919 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:50:35,919 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-14 21:50:35,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:35 BoogieIcfgContainer [2019-10-14 21:50:35,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:50:35,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:50:35,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:50:35,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:50:35,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:50:35" (1/3) ... [2019-10-14 21:50:35,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad630a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:35, skipping insertion in model container [2019-10-14 21:50:35,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:35" (2/3) ... [2019-10-14 21:50:35,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad630a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:35, skipping insertion in model container [2019-10-14 21:50:35,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:35" (3/3) ... [2019-10-14 21:50:35,938 INFO L109 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2019-10-14 21:50:35,952 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:50:35,959 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:50:35,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:50:35,996 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:50:35,996 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:50:35,996 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:50:35,997 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:50:35,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:50:35,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:50:35,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:50:35,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:50:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-10-14 21:50:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 21:50:36,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:36,021 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:36,022 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:36,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash -285010775, now seen corresponding path program 1 times [2019-10-14 21:50:36,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:36,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802557737] [2019-10-14 21:50:36,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,243 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-14 21:50:36,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802557737] [2019-10-14 21:50:36,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:36,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 21:50:36,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308203739] [2019-10-14 21:50:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 21:50:36,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:36,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 21:50:36,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 21:50:36,267 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2019-10-14 21:50:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:36,375 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2019-10-14 21:50:36,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 21:50:36,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-14 21:50:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:36,386 INFO L225 Difference]: With dead ends: 59 [2019-10-14 21:50:36,386 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 21:50:36,390 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-14 21:50:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 21:50:36,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-14 21:50:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-14 21:50:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-14 21:50:36,430 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-10-14 21:50:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:36,431 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-14 21:50:36,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 21:50:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-14 21:50:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 21:50:36,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:36,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:36,433 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:36,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:36,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1627005719, now seen corresponding path program 1 times [2019-10-14 21:50:36,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:36,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593873918] [2019-10-14 21:50:36,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,574 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-14 21:50:36,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593873918] [2019-10-14 21:50:36,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:36,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:36,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279211312] [2019-10-14 21:50:36,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:36,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:36,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:36,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:36,582 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 4 states. [2019-10-14 21:50:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:36,716 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-10-14 21:50:36,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:36,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-14 21:50:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:36,718 INFO L225 Difference]: With dead ends: 51 [2019-10-14 21:50:36,718 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:50:36,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:50:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 21:50:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 21:50:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-14 21:50:36,732 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-10-14 21:50:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:36,732 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-14 21:50:36,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-14 21:50:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:50:36,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:36,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:36,737 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:36,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:36,737 INFO L82 PathProgramCache]: Analyzing trace with hash -381446827, now seen corresponding path program 1 times [2019-10-14 21:50:36,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:36,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215347208] [2019-10-14 21:50:36,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,885 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-14 21:50:36,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215347208] [2019-10-14 21:50:36,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:36,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:36,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987496951] [2019-10-14 21:50:36,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:36,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:36,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:36,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:36,888 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-10-14 21:50:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:37,063 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-10-14 21:50:37,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:50:37,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:50:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:37,066 INFO L225 Difference]: With dead ends: 58 [2019-10-14 21:50:37,067 INFO L226 Difference]: Without dead ends: 41 [2019-10-14 21:50:37,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-14 21:50:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-10-14 21:50:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 21:50:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-14 21:50:37,080 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-10-14 21:50:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:37,081 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-14 21:50:37,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-14 21:50:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:50:37,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:37,082 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:37,082 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1677394545, now seen corresponding path program 1 times [2019-10-14 21:50:37,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:37,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076538545] [2019-10-14 21:50:37,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:37,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:37,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 21:50:37,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076538545] [2019-10-14 21:50:37,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7830527] [2019-10-14 21:50:37,190 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-14 21:50:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:50:37,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 21:50:37,313 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:37,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-14 21:50:37,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143200725] [2019-10-14 21:50:37,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 21:50:37,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:37,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 21:50:37,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:50:37,315 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-10-14 21:50:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:37,414 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-10-14 21:50:37,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:50:37,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-10-14 21:50:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:37,416 INFO L225 Difference]: With dead ends: 59 [2019-10-14 21:50:37,416 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 21:50:37,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 21:50:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 21:50:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-14 21:50:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 21:50:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-14 21:50:37,424 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2019-10-14 21:50:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:37,424 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-14 21:50:37,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 21:50:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-14 21:50:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 21:50:37,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:37,426 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:37,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:37,629 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:37,630 INFO L82 PathProgramCache]: Analyzing trace with hash 760173005, now seen corresponding path program 2 times [2019-10-14 21:50:37,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:37,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103057185] [2019-10-14 21:50:37,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:37,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:37,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 21:50:37,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103057185] [2019-10-14 21:50:37,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044667233] [2019-10-14 21:50:37,768 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-14 21:50:37,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:37,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:37,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 21:50:37,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 21:50:37,869 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:37,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-14 21:50:37,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768283850] [2019-10-14 21:50:37,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 21:50:37,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:37,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 21:50:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:50:37,871 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2019-10-14 21:50:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:38,088 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-14 21:50:38,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 21:50:38,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-14 21:50:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:38,091 INFO L225 Difference]: With dead ends: 72 [2019-10-14 21:50:38,091 INFO L226 Difference]: Without dead ends: 53 [2019-10-14 21:50:38,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-14 21:50:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-14 21:50:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2019-10-14 21:50:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 21:50:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-14 21:50:38,107 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 30 [2019-10-14 21:50:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:38,107 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-14 21:50:38,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 21:50:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-14 21:50:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 21:50:38,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:38,109 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:38,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:38,313 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1484472327, now seen corresponding path program 3 times [2019-10-14 21:50:38,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:38,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561072171] [2019-10-14 21:50:38,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:38,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:38,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:39,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561072171] [2019-10-14 21:50:39,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918023807] [2019-10-14 21:50:39,441 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-14 21:50:39,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 21:50:39,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:39,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-14 21:50:39,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:39,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-10-14 21:50:39,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2019-10-14 21:50:39,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-10-14 21:50:39,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:40 [2019-10-14 21:50:39,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:39,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2019-10-14 21:50:39,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:72 [2019-10-14 21:50:40,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:40,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:40,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 187 [2019-10-14 21:50:40,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:40,174 INFO L567 ElimStorePlain]: treesize reduction 148, result has 44.4 percent of original size [2019-10-14 21:50:40,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:40,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:171, output treesize:118 [2019-10-14 21:50:40,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:40,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:40,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:40,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 21:50:40,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:40,676 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:40,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 132 [2019-10-14 21:50:40,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:40,780 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-14 21:50:40,781 INFO L567 ElimStorePlain]: treesize reduction 42, result has 76.1 percent of original size [2019-10-14 21:50:40,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:40,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:189, output treesize:134 [2019-10-14 21:50:41,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:41,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:41,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:41,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:41,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:41,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:41,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 4 case distinctions, treesize of input 134 treesize of output 234 [2019-10-14 21:50:41,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,184 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-10-14 21:50:41,185 INFO L567 ElimStorePlain]: treesize reduction 93, result has 67.9 percent of original size [2019-10-14 21:50:41,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:41,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:181, output treesize:186 [2019-10-14 21:50:41,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:44,357 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-10-14 21:50:44,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:44,368 INFO L392 ElimStorePlain]: Different costs {54=[v_prenex_4], 88=[|v_#memory_int_21|]} [2019-10-14 21:50:44,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:44,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:44,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 142 [2019-10-14 21:50:44,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:44,685 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-10-14 21:50:44,686 INFO L567 ElimStorePlain]: treesize reduction 45, result has 84.7 percent of original size [2019-10-14 21:50:44,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:44,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:44,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:44,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:44,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 168 [2019-10-14 21:50:44,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:44,903 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-10-14 21:50:44,904 INFO L567 ElimStorePlain]: treesize reduction 42, result has 83.1 percent of original size [2019-10-14 21:50:44,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-10-14 21:50:44,907 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:297, output treesize:192 [2019-10-14 21:50:45,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,119 INFO L392 ElimStorePlain]: Different costs {40=[|v_#memory_int_22|], 70=[v_prenex_8]} [2019-10-14 21:50:45,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,159 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,160 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 2 case distinctions, treesize of input 130 treesize of output 173 [2019-10-14 21:50:45,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,439 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-10-14 21:50:45,439 INFO L567 ElimStorePlain]: treesize reduction 56, result has 82.4 percent of original size [2019-10-14 21:50:45,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:45,510 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:45,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 151 treesize of output 238 [2019-10-14 21:50:45,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:45,754 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2019-10-14 21:50:45,754 INFO L567 ElimStorePlain]: treesize reduction 74, result has 79.2 percent of original size [2019-10-14 21:50:45,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-10-14 21:50:45,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:282, output treesize:252 [2019-10-14 21:50:45,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:45,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,087 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-10-14 21:50:46,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:46,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:50,649 WARN L191 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2019-10-14 21:50:50,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:50:50,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-10-14 21:50:50,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:50,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:50,842 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-14 21:50:50,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:3 [2019-10-14 21:50:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:50,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:50,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 41 [2019-10-14 21:50:50,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261615175] [2019-10-14 21:50:50,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-14 21:50:50,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-14 21:50:50,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2019-10-14 21:50:50,947 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 41 states. [2019-10-14 21:50:53,998 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-10-14 21:50:56,339 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-10-14 21:51:01,003 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-10-14 21:51:01,225 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2019-10-14 21:51:01,601 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 79 [2019-10-14 21:51:01,837 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-10-14 21:51:02,386 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-10-14 21:51:02,806 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 98 [2019-10-14 21:51:03,430 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-10-14 21:51:05,758 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 65