/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:21:11,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:21:11,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:21:11,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:21:11,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:21:11,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:21:11,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:21:11,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:21:11,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:21:11,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:21:11,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:21:11,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:21:11,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:21:11,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:21:11,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:21:11,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:21:11,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:21:11,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:21:11,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:21:11,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:21:11,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:21:11,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:21:11,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:21:11,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:21:11,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:21:11,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:21:11,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:21:11,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:21:11,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:21:11,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:21:11,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:21:11,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:21:11,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:21:11,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:21:11,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:21:11,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:21:11,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:21:11,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:21:11,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:21:11,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:21:11,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:21:11,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:21:11,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:21:11,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:21:11,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:21:11,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:21:11,846 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:21:11,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:21:11,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:21:11,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:21:11,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:21:11,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:21:11,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:21:11,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:21:11,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:21:11,849 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:21:11,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:21:11,849 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:21:11,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:21:11,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:21:11,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:21:11,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:21:11,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:21:11,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:21:11,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:21:11,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:21:11,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:21:11,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:21:11,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:21:11,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:21:11,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:21:12,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:21:12,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:21:12,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:21:12,194 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:21:12,195 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:21:12,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2019-11-06 21:21:12,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db45a34b6/68480ae1dc954ce3a0995d4d8d8cab74/FLAG8b924609b [2019-11-06 21:21:12,728 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:21:12,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2019-11-06 21:21:12,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db45a34b6/68480ae1dc954ce3a0995d4d8d8cab74/FLAG8b924609b [2019-11-06 21:21:13,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db45a34b6/68480ae1dc954ce3a0995d4d8d8cab74 [2019-11-06 21:21:13,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:21:13,115 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:21:13,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:21:13,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:21:13,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:21:13,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:21:13" (1/1) ... [2019-11-06 21:21:13,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262c9455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13, skipping insertion in model container [2019-11-06 21:21:13,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:21:13" (1/1) ... [2019-11-06 21:21:13,131 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:21:13,153 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:21:13,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:21:13,350 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:21:13,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:21:13,388 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:21:13,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13 WrapperNode [2019-11-06 21:21:13,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:21:13,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:21:13,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:21:13,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:21:13,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13" (1/1) ... [2019-11-06 21:21:13,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13" (1/1) ... [2019-11-06 21:21:13,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13" (1/1) ... [2019-11-06 21:21:13,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13" (1/1) ... [2019-11-06 21:21:13,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13" (1/1) ... [2019-11-06 21:21:13,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13" (1/1) ... [2019-11-06 21:21:13,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13" (1/1) ... [2019-11-06 21:21:13,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:21:13,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:21:13,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:21:13,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:21:13,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:21:13,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:21:13,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:21:13,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 21:21:13,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:21:13,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:21:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 21:21:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:21:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-11-06 21:21:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:21:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:21:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:21:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:21:13,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:21:13,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:21:13,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:21:13,794 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:21:13,794 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 21:21:13,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:21:13 BoogieIcfgContainer [2019-11-06 21:21:13,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:21:13,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:21:13,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:21:13,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:21:13,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:21:13" (1/3) ... [2019-11-06 21:21:13,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec82cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:21:13, skipping insertion in model container [2019-11-06 21:21:13,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:13" (2/3) ... [2019-11-06 21:21:13,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec82cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:21:13, skipping insertion in model container [2019-11-06 21:21:13,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:21:13" (3/3) ... [2019-11-06 21:21:13,804 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i [2019-11-06 21:21:13,815 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:21:13,822 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:21:13,846 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:21:13,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:21:13,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:21:13,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:21:13,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:21:13,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:21:13,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:21:13,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:21:13,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:21:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-06 21:21:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 21:21:13,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:13,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:13,906 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1079158542, now seen corresponding path program 1 times [2019-11-06 21:21:13,918 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:13,919 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053750304] [2019-11-06 21:21:13,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:14,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053750304] [2019-11-06 21:21:14,189 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:21:14,189 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:21:14,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243475634] [2019-11-06 21:21:14,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:21:14,195 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:14,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:21:14,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:21:14,209 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 6 states. [2019-11-06 21:21:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:14,454 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2019-11-06 21:21:14,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:21:14,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-06 21:21:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:14,465 INFO L225 Difference]: With dead ends: 56 [2019-11-06 21:21:14,466 INFO L226 Difference]: Without dead ends: 30 [2019-11-06 21:21:14,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:21:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-06 21:21:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-11-06 21:21:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-06 21:21:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-06 21:21:14,517 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2019-11-06 21:21:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:14,517 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-06 21:21:14,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:21:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-06 21:21:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-06 21:21:14,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:14,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:14,520 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:14,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash -476045897, now seen corresponding path program 1 times [2019-11-06 21:21:14,521 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:14,522 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265263430] [2019-11-06 21:21:14,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:14,630 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265263430] [2019-11-06 21:21:14,630 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:21:14,631 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:21:14,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139947695] [2019-11-06 21:21:14,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:21:14,633 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:21:14,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:21:14,633 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 4 states. [2019-11-06 21:21:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:14,703 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-11-06 21:21:14,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:21:14,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-06 21:21:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:14,705 INFO L225 Difference]: With dead ends: 36 [2019-11-06 21:21:14,705 INFO L226 Difference]: Without dead ends: 26 [2019-11-06 21:21:14,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:21:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-06 21:21:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-06 21:21:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-06 21:21:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-11-06 21:21:14,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2019-11-06 21:21:14,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:14,717 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-06 21:21:14,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:21:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-11-06 21:21:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:21:14,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:14,718 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:14,719 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1393486425, now seen corresponding path program 1 times [2019-11-06 21:21:14,720 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:14,721 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730099955] [2019-11-06 21:21:14,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:15,034 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730099955] [2019-11-06 21:21:15,034 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349790824] [2019-11-06 21:21:15,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:21:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:15,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-06 21:21:15,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:21:17,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:17,627 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:21:17,627 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2019-11-06 21:21:17,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205542132] [2019-11-06 21:21:17,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:21:17,633 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:21:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=122, Unknown=1, NotChecked=0, Total=156 [2019-11-06 21:21:17,634 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2019-11-06 21:21:20,459 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-11-06 21:21:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:26,951 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-11-06 21:21:26,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:21:26,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2019-11-06 21:21:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:26,953 INFO L225 Difference]: With dead ends: 40 [2019-11-06 21:21:26,953 INFO L226 Difference]: Without dead ends: 27 [2019-11-06 21:21:26,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=59, Invalid=212, Unknown=1, NotChecked=0, Total=272 [2019-11-06 21:21:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-06 21:21:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-11-06 21:21:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-06 21:21:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-11-06 21:21:26,961 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-11-06 21:21:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:26,961 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-11-06 21:21:26,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:21:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-11-06 21:21:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:21:26,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:26,963 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:27,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:21:27,168 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash 618852702, now seen corresponding path program 1 times [2019-11-06 21:21:27,168 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:27,169 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232874051] [2019-11-06 21:21:27,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:27,657 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 36 [2019-11-06 21:21:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:27,779 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232874051] [2019-11-06 21:21:27,780 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947144144] [2019-11-06 21:21:27,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:21:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:27,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-06 21:21:27,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:21:31,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:31,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:31,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:31,862 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:21:31,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:21:31,876 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:21:31,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:21:31,886 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:21:31,886 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:21:32,056 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-11-06 21:21:32,057 INFO L341 Elim1Store]: treesize reduction 44, result has 66.9 percent of original size [2019-11-06 21:21:32,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 157 [2019-11-06 21:21:32,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,081 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:21:32,320 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2019-11-06 21:21:32,321 INFO L567 ElimStorePlain]: treesize reduction 99, result has 34.4 percent of original size [2019-11-06 21:21:32,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:21:32,326 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:461, output treesize:7 [2019-11-06 21:21:32,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:21:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:32,372 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:21:32,372 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 13 [2019-11-06 21:21:32,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620741145] [2019-11-06 21:21:32,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 21:21:32,373 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:32,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 21:21:32,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2019-11-06 21:21:32,374 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2019-11-06 21:21:34,629 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-06 21:21:35,100 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-06 21:21:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:39,194 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-06 21:21:39,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:21:39,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-06 21:21:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:39,196 INFO L225 Difference]: With dead ends: 23 [2019-11-06 21:21:39,196 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:21:39,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=50, Invalid=189, Unknown=1, NotChecked=0, Total=240 [2019-11-06 21:21:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:21:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:21:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:21:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:21:39,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-11-06 21:21:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:39,198 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:21:39,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 21:21:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:21:39,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:21:39,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:21:39,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:21:39,628 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-06 21:21:40,025 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-11-06 21:21:40,026 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:21:40,027 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-11-06 21:21:40,027 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:21:40,027 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:21:40,027 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:21:40,027 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:21:40,027 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:21:40,028 INFO L439 ceAbstractionStarter]: At program point L31-2(lines 31 37) the Hoare annotation is: (or (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (= 0 main_~loop_entered~0)) (let ((.cse2 (+ main_~index2~0 1))) (let ((.cse0 (* 4294967296 (div .cse2 4294967296)))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* (mod (+ main_~index1~0 4294967295) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* (mod .cse2 4294967296) 4) |main_~#array~0.offset|)) 4294967296))) (<= main_~index2~0 (+ .cse0 99998)))))) [2019-11-06 21:21:40,028 INFO L443 ceAbstractionStarter]: For program point L31-3(lines 20 47) no Hoare annotation was computed. [2019-11-06 21:21:40,028 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2019-11-06 21:21:40,028 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 19 47) no Hoare annotation was computed. [2019-11-06 21:21:40,028 INFO L439 ceAbstractionStarter]: At program point L40-2(lines 40 44) the Hoare annotation is: (or (let ((.cse2 (+ main_~index2~0 1))) (let ((.cse0 (* 4294967296 (div .cse2 4294967296)))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* (mod (+ main_~index1~0 4294967295) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* (mod .cse2 4294967296) 4) |main_~#array~0.offset|)) 4294967296))) (<= main_~index2~0 (+ .cse0 99998))))) (let ((.cse3 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse3 99999)) (<= (+ .cse3 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296))))))) [2019-11-06 21:21:40,029 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (or (and (<= main_~index2~0 (+ .cse0 99999)) (= 0 main_~loop_entered~0)) (and (<= (+ (* 4294967296 (div (+ main_~index2~0 1) 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ .cse0 99998)))) (<= (+ .cse0 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))) [2019-11-06 21:21:40,029 INFO L443 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2019-11-06 21:21:40,029 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: (= |#valid| |old(#valid)|) [2019-11-06 21:21:40,029 INFO L439 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (let ((.cse2 (+ main_~index2~0 1))) (let ((.cse0 (* 4294967296 (div .cse2 4294967296))) (.cse4 (* 4294967296 (div |main_#t~mem7| 4294967296))) (.cse3 (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* (mod (+ main_~index1~0 4294967295) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* (mod .cse2 4294967296) 4) |main_~#array~0.offset|)) 4294967296))) (< .cse3 (+ .cse4 |main_#t~mem8| 1)) (<= main_~index2~0 (+ .cse0 99998)) (<= (mod main_~index2~0 4294967296) (mod main_~index1~0 4294967296)) (<= (+ .cse4 |main_#t~mem8|) .cse3)))) [2019-11-06 21:21:40,030 INFO L443 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2019-11-06 21:21:40,030 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2019-11-06 21:21:40,030 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2019-11-06 21:21:40,030 INFO L443 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2019-11-06 21:21:40,030 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2019-11-06 21:21:40,030 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2019-11-06 21:21:40,031 INFO L443 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2019-11-06 21:21:40,031 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-11-06 21:21:40,039 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,040 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,046 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,047 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,049 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,049 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:21:40 BoogieIcfgContainer [2019-11-06 21:21:40,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:21:40,054 INFO L168 Benchmark]: Toolchain (without parser) took 26939.20 ms. Allocated memory was 136.8 MB in the beginning and 250.1 MB in the end (delta: 113.2 MB). Free memory was 102.4 MB in the beginning and 151.3 MB in the end (delta: -48.9 MB). Peak memory consumption was 64.3 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:40,055 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-06 21:21:40,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.09 ms. Allocated memory is still 136.8 MB. Free memory was 102.1 MB in the beginning and 91.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:40,057 INFO L168 Benchmark]: Boogie Preprocessor took 115.47 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 91.9 MB in the beginning and 177.3 MB in the end (delta: -85.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:40,058 INFO L168 Benchmark]: RCFGBuilder took 290.73 ms. Allocated memory is still 199.8 MB. Free memory was 177.3 MB in the beginning and 162.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:40,059 INFO L168 Benchmark]: TraceAbstraction took 26255.63 ms. Allocated memory was 199.8 MB in the beginning and 250.1 MB in the end (delta: 50.3 MB). Free memory was 162.8 MB in the beginning and 151.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 61.9 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:40,063 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 136.8 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.09 ms. Allocated memory is still 136.8 MB. Free memory was 102.1 MB in the beginning and 91.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.47 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 91.9 MB in the beginning and 177.3 MB in the end (delta: -85.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 290.73 ms. Allocated memory is still 199.8 MB. Free memory was 177.3 MB in the beginning and 162.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26255.63 ms. Allocated memory was 199.8 MB in the beginning and 250.1 MB in the end (delta: 50.3 MB). Free memory was 162.8 MB in the beginning and 151.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 61.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant [2019-11-06 21:21:40,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && unknown-#memory_int-unknown[array][(index1 + 4294967295) % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][(index2 + 1) % 4294967296 * 4 + array] % 4294967296) && index2 <= 4294967296 * ((index2 + 1) / 4294967296) + 99998) || (index2 <= 4294967296 * (index2 / 4294967296) + 99999 && 4294967296 * (index2 / 4294967296) + index1 + 1 <= index2 + 4294967296 * (index1 / 4294967296)) - InvariantResult [Line: 31]: Loop Invariant [2019-11-06 21:21:40,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,076 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,076 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:40,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((index1 <= 4294967296 * (index1 / 4294967296) + 99999 && index2 <= 4294967296 * (index2 / 4294967296) + 99999) && 0 == loop_entered) || ((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && unknown-#memory_int-unknown[array][(index1 + 4294967295) % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][(index2 + 1) % 4294967296 * 4 + array] % 4294967296) && index2 <= 4294967296 * ((index2 + 1) / 4294967296) + 99998) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Result: SAFE, OverallTime: 26.1s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 61 SDtfs, 64 SDslu, 144 SDs, 0 SdLazy, 237 SolverSat, 29 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 354 HoareAnnotationTreeSize, 15 FomulaSimplifications, 128 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 194 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 19088 SizeOfPredicates, 9 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 11/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...