java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:48:08,048 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:48:08,050 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:48:08,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:48:08,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:48:08,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:48:08,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:48:08,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:48:08,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:48:08,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:48:08,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:48:08,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:48:08,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:48:08,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:48:08,077 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:48:08,078 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:48:08,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:48:08,081 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:48:08,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:48:08,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:48:08,085 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:48:08,086 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:48:08,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:48:08,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:48:08,089 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:48:08,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:48:08,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:48:08,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:48:08,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:48:08,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:48:08,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:48:08,095 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:48:08,095 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:48:08,095 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:48:08,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:48:08,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:48:08,097 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:48:08,120 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:48:08,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:48:08,123 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:48:08,123 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:48:08,126 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:48:08,126 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:48:08,126 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:48:08,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:48:08,128 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:48:08,128 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:48:08,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:48:08,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:48:08,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:48:08,129 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:48:08,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:48:08,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:48:08,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:48:08,129 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:48:08,130 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:48:08,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:48:08,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:48:08,130 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:48:08,130 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:48:08,132 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:48:08,132 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:48:08,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:48:08,132 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:48:08,133 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:48:08,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:48:08,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:48:08,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:48:08,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:48:08,216 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:48:08,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-06 22:48:08,272 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da02dd8b0/12b2b6fdc12445a9aea378a61db3d2dc/FLAG784e07658 [2018-11-06 22:48:08,688 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:48:08,689 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-06 22:48:08,702 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da02dd8b0/12b2b6fdc12445a9aea378a61db3d2dc/FLAG784e07658 [2018-11-06 22:48:08,716 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da02dd8b0/12b2b6fdc12445a9aea378a61db3d2dc [2018-11-06 22:48:08,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:48:08,727 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:48:08,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:48:08,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:48:08,732 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:48:08,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:08" (1/1) ... [2018-11-06 22:48:08,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb2d5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:08, skipping insertion in model container [2018-11-06 22:48:08,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:08" (1/1) ... [2018-11-06 22:48:08,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:48:08,786 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:48:09,035 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:48:09,039 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:48:09,073 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:48:09,098 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:48:09,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09 WrapperNode [2018-11-06 22:48:09,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:48:09,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:48:09,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:48:09,101 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:48:09,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:48:09,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:48:09,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:48:09,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:48:09,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:48:09,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:48:09,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:48:09,180 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:48:09,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (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 [2018-11-06 22:48:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-06 22:48:09,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:48:09,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:48:09,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-06 22:48:09,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-06 22:48:09,873 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:48:09,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:09 BoogieIcfgContainer [2018-11-06 22:48:09,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:48:09,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:48:09,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:48:09,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:48:09,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:48:08" (1/3) ... [2018-11-06 22:48:09,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afa272f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:09, skipping insertion in model container [2018-11-06 22:48:09,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09" (2/3) ... [2018-11-06 22:48:09,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afa272f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:09, skipping insertion in model container [2018-11-06 22:48:09,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:09" (3/3) ... [2018-11-06 22:48:09,882 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-06 22:48:09,891 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:48:09,898 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-06 22:48:09,915 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-06 22:48:09,949 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:48:09,950 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:48:09,950 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:48:09,950 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:48:09,951 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:48:09,951 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:48:09,951 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:48:09,951 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:48:09,951 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:48:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-11-06 22:48:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-06 22:48:09,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:09,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:09,979 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:09,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:09,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1165652749, now seen corresponding path program 1 times [2018-11-06 22:48:09,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:09,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:10,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:10,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:10,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:48:10,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:10,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:48:10,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:48:10,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:48:10,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:48:10,223 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 4 states. [2018-11-06 22:48:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:10,440 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-11-06 22:48:10,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:48:10,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-06 22:48:10,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:10,462 INFO L225 Difference]: With dead ends: 104 [2018-11-06 22:48:10,462 INFO L226 Difference]: Without dead ends: 67 [2018-11-06 22:48:10,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:48:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-06 22:48:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2018-11-06 22:48:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-06 22:48:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-06 22:48:10,512 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 12 [2018-11-06 22:48:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:10,513 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-06 22:48:10,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:48:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-06 22:48:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-06 22:48:10,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:10,515 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:10,515 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:10,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1249395250, now seen corresponding path program 1 times [2018-11-06 22:48:10,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:10,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:10,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:10,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:48:10,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:10,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:48:10,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:48:10,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:48:10,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:48:10,609 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 3 states. [2018-11-06 22:48:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:10,871 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-06 22:48:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:48:10,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-06 22:48:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:10,873 INFO L225 Difference]: With dead ends: 81 [2018-11-06 22:48:10,873 INFO L226 Difference]: Without dead ends: 55 [2018-11-06 22:48:10,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:48:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-06 22:48:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-11-06 22:48:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-06 22:48:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-06 22:48:10,883 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 12 [2018-11-06 22:48:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:10,884 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-06 22:48:10,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:48:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-06 22:48:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-06 22:48:10,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:10,885 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:10,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:10,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1852712234, now seen corresponding path program 1 times [2018-11-06 22:48:10,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:10,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:10,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:10,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:48:10,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:10,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:48:10,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:48:10,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:48:10,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:48:10,944 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 3 states. [2018-11-06 22:48:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:11,070 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-06 22:48:11,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:48:11,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-06 22:48:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:11,074 INFO L225 Difference]: With dead ends: 75 [2018-11-06 22:48:11,074 INFO L226 Difference]: Without dead ends: 49 [2018-11-06 22:48:11,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:48:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-06 22:48:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2018-11-06 22:48:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-06 22:48:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-06 22:48:11,082 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 13 [2018-11-06 22:48:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:11,082 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-06 22:48:11,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:48:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-06 22:48:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-06 22:48:11,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:11,084 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:11,084 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:11,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1762141581, now seen corresponding path program 1 times [2018-11-06 22:48:11,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:11,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:48:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:48:11,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:48:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:48:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:48:11,180 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2018-11-06 22:48:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:11,215 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-06 22:48:11,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:48:11,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-06 22:48:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:11,219 INFO L225 Difference]: With dead ends: 52 [2018-11-06 22:48:11,219 INFO L226 Difference]: Without dead ends: 36 [2018-11-06 22:48:11,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:48:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-06 22:48:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-06 22:48:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-06 22:48:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-06 22:48:11,225 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 14 [2018-11-06 22:48:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:11,225 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-06 22:48:11,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:48:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-06 22:48:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-06 22:48:11,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:11,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:11,227 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:11,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1452918724, now seen corresponding path program 1 times [2018-11-06 22:48:11,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:11,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:48:11,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:11,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:48:11,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:48:11,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:48:11,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:48:11,332 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 6 states. [2018-11-06 22:48:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:11,542 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-11-06 22:48:11,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:48:11,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-06 22:48:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:11,544 INFO L225 Difference]: With dead ends: 69 [2018-11-06 22:48:11,544 INFO L226 Difference]: Without dead ends: 67 [2018-11-06 22:48:11,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:48:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-06 22:48:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 34. [2018-11-06 22:48:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-06 22:48:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-06 22:48:11,553 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2018-11-06 22:48:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:11,554 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-06 22:48:11,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:48:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-06 22:48:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-06 22:48:11,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:11,555 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:11,556 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:11,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1434001439, now seen corresponding path program 1 times [2018-11-06 22:48:11,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:11,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:48:11,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:11,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:48:11,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:48:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:48:11,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:48:11,725 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 6 states. [2018-11-06 22:48:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:12,413 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-11-06 22:48:12,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:48:12,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-06 22:48:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:12,417 INFO L225 Difference]: With dead ends: 109 [2018-11-06 22:48:12,417 INFO L226 Difference]: Without dead ends: 86 [2018-11-06 22:48:12,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:48:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-06 22:48:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 40. [2018-11-06 22:48:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-06 22:48:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-06 22:48:12,428 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 21 [2018-11-06 22:48:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:12,428 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-06 22:48:12,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:48:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-06 22:48:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-06 22:48:12,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:12,430 INFO L375 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] [2018-11-06 22:48:12,430 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:12,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2078417290, now seen corresponding path program 1 times [2018-11-06 22:48:12,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:12,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:12,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:48:12,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:12,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:48:12,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:48:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:48:12,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:48:12,547 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2018-11-06 22:48:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:12,680 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-11-06 22:48:12,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:48:12,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-06 22:48:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:12,684 INFO L225 Difference]: With dead ends: 79 [2018-11-06 22:48:12,684 INFO L226 Difference]: Without dead ends: 56 [2018-11-06 22:48:12,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:48:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-06 22:48:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2018-11-06 22:48:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-06 22:48:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-11-06 22:48:12,695 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 22 [2018-11-06 22:48:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:12,696 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-06 22:48:12,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:48:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-11-06 22:48:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-06 22:48:12,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:12,697 INFO L375 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] [2018-11-06 22:48:12,698 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:12,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1710974140, now seen corresponding path program 1 times [2018-11-06 22:48:12,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:12,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:12,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:12,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:13,381 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-11-06 22:48:13,776 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-06 22:48:14,053 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2018-11-06 22:48:14,402 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2018-11-06 22:48:23,604 WARN L179 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-11-06 22:48:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:48:30,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:30,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-06 22:48:30,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 22:48:30,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 22:48:30,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=184, Unknown=7, NotChecked=0, Total=240 [2018-11-06 22:48:30,888 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 16 states. [2018-11-06 22:48:37,298 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-06 22:48:43,851 WARN L179 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2018-11-06 22:49:16,074 WARN L179 SmtUtils]: Spent 24.75 s on a formula simplification. DAG size of input: 101 DAG size of output: 69 [2018-11-06 22:49:21,652 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (div c_ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__array~0.base|)) (.cse18 (div c_ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse1 (* 4 c_ULTIMATE.start_main_~main__index2~0)) (.cse9 (select .cse15 (+ |c_ULTIMATE.start_main_~#main__array~0.offset| (+ (* 4 c_ULTIMATE.start_main_~main__index1~0) (* (- 17179869184) .cse18))))) (.cse5 (* 4294967296 .cse2)) (.cse17 (* 4294967296 .cse18))) (let ((.cse4 (+ c_ULTIMATE.start_main_~main__index2~0 .cse17)) (.cse3 (+ c_ULTIMATE.start_main_~main__index1~0 .cse5 2)) (.cse8 (- .cse9)) (.cse7 (select .cse15 (+ (* (- 17179869184) .cse2) (+ |c_ULTIMATE.start_main_~#main__array~0.offset| .cse1)))) (.cse0 (= |c_ULTIMATE.start_main_~#main__array~0.offset| 0)) (.cse6 (<= c_ULTIMATE.start_main_~main__index1~0 (+ .cse17 99999)))) (and (or (and .cse0 (<= (+ .cse1 |c_ULTIMATE.start_main_~#main__array~0.offset|) (+ (* 17179869184 .cse2) 399996))) (<= .cse3 .cse4)) (or (and (< .cse4 (+ c_ULTIMATE.start_main_~main__index1~0 .cse5 100000)) .cse6) (< .cse4 .cse3)) (<= (* 4294967296 (div (+ .cse7 (* (- 4294967296) (div (+ .cse8 .cse7) 4294967296))) 4294967296)) .cse9) (<= (+ (* 4294967296 (div (+ .cse8 (+ .cse7 4294967295)) 4294967296)) (* 4294967296 (div .cse9 4294967296))) .cse7) (let ((.cse10 (div (+ c_ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296))) (or (<= c_ULTIMATE.start_main_~main__index1~0 (+ c_ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (* 4294967296 .cse10) (+ (- c_ULTIMATE.start_main_~main__index2~0) 199997)) 4294967296)))) (let ((.cse16 (+ c_ULTIMATE.start_main_~main__index1~0 (* (- 4294967296) (div (+ c_ULTIMATE.start_main_~main__index1~0 4294867296) 4294967296))))) (let ((.cse14 (* 4294967296 (div (+ (* 17179869184 .cse10) (+ (- |c_ULTIMATE.start_main_~#main__array~0.offset|) (+ (* (- 4) c_ULTIMATE.start_main_~main__index2~0) 399992))) 17179869184))) (.cse13 (select .cse15 (+ |c_ULTIMATE.start_main_~#main__array~0.offset| (* 4 .cse16))))) (let ((.cse12 (- .cse13)) (.cse11 (select .cse15 (+ (* 4 (+ .cse16 (+ .cse14 (+ (- c_ULTIMATE.start_main_~main__index1~0) c_ULTIMATE.start_main_~main__index2~0)))) |c_ULTIMATE.start_main_~#main__array~0.offset|)))) (and (<= (* 4294967296 (div (+ .cse11 (* (- 4294967296) (div (+ .cse12 .cse11) 4294967296))) 4294967296)) .cse13) (<= (+ (* 4294967296 (div (+ .cse12 (+ .cse11 4294967295)) 4294967296)) (* 4294967296 (div .cse13 4294967296))) .cse11) .cse0 (<= c_ULTIMATE.start_main_~main__index1~0 (+ c_ULTIMATE.start_main_~main__index2~0 .cse14 1)))))))) .cse0 .cse6)))) is different from false [2018-11-06 22:49:25,900 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 50 [2018-11-06 22:49:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:49:28,234 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-06 22:49:28,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 22:49:28,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-06 22:49:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:49:28,235 INFO L225 Difference]: With dead ends: 60 [2018-11-06 22:49:28,236 INFO L226 Difference]: Without dead ends: 58 [2018-11-06 22:49:28,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 64.8s TimeCoverageRelationStatistics Valid=144, Invalid=549, Unknown=13, NotChecked=50, Total=756 [2018-11-06 22:49:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-06 22:49:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-11-06 22:49:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-06 22:49:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-06 22:49:28,248 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 23 [2018-11-06 22:49:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:49:28,248 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-06 22:49:28,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 22:49:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-06 22:49:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-06 22:49:28,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:49:28,250 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:49:28,250 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:49:28,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:49:28,251 INFO L82 PathProgramCache]: Analyzing trace with hash -427099392, now seen corresponding path program 1 times [2018-11-06 22:49:28,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:49:28,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:49:28,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:49:28,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:49:28,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:49:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:49:28,558 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-11-06 22:49:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:49:28,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:49:28,693 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:49:28,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:49:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:49:28,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:49:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:49:28,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:49:28,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-06 22:49:28,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 22:49:28,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 22:49:28,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:49:28,912 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 8 states. [2018-11-06 22:49:33,340 WARN L179 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-06 22:49:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:49:33,424 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-11-06 22:49:33,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:49:33,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-06 22:49:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:49:33,425 INFO L225 Difference]: With dead ends: 65 [2018-11-06 22:49:33,425 INFO L226 Difference]: Without dead ends: 34 [2018-11-06 22:49:33,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:49:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-06 22:49:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-06 22:49:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-06 22:49:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-06 22:49:33,438 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-11-06 22:49:33,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:49:33,440 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-06 22:49:33,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 22:49:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-06 22:49:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-06 22:49:33,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:49:33,442 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:49:33,443 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:49:33,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:49:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1062431528, now seen corresponding path program 1 times [2018-11-06 22:49:33,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:49:33,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:49:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:49:33,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:49:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:49:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:49:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:49:42,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:49:42,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-06 22:49:42,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 22:49:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 22:49:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=187, Unknown=2, NotChecked=0, Total=240 [2018-11-06 22:49:42,411 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 16 states. [2018-11-06 22:50:03,283 WARN L179 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 65 DAG size of output: 31 [2018-11-06 22:50:18,915 WARN L179 SmtUtils]: Spent 8.35 s on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2018-11-06 22:50:33,734 WARN L179 SmtUtils]: Spent 7.79 s on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2018-11-06 22:50:49,108 WARN L179 SmtUtils]: Spent 8.51 s on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2018-11-06 22:50:56,010 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse7 (div (+ c_ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296))) (let ((.cse0 (* 8589934592 .cse7))) (let ((.cse10 (div c_ULTIMATE.start_main_~main__index1~0 4294967296)) (.cse5 (div (+ c_ULTIMATE.start_main_~main__index1~0 (+ (- c_ULTIMATE.start_main_~main__index2~0) (+ .cse0 4294967294))) 4294967296))) (let ((.cse8 (* 4294967296 (div c_ULTIMATE.start_main_~main__index2~0 4294967296))) (.cse1 (* 4294967296 .cse5)) (.cse9 (* 4294967296 .cse10)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__array~0.base|))) (and (or (<= (+ c_ULTIMATE.start_main_~main__index1~0 .cse0) (+ c_ULTIMATE.start_main_~main__index2~0 .cse1)) (let ((.cse6 (+ c_ULTIMATE.start_main_~main__index2~0 (* (- 4294967296) .cse7)))) (let ((.cse2 (select .cse4 (+ |c_ULTIMATE.start_main_~#main__array~0.offset| (* 4 .cse6))))) (<= .cse2 (let ((.cse3 (select .cse4 (+ |c_ULTIMATE.start_main_~#main__array~0.offset| (* 4 (+ c_ULTIMATE.start_main_~main__index1~0 (+ c_ULTIMATE.start_main_~main__index2~0 (+ (* (- 4294967296) .cse5) (- .cse6))))))))) (+ (* 4294967296 (div (+ .cse2 (- .cse3)) 4294967296)) .cse3)))))) (<= (+ c_ULTIMATE.start_main_~main__index1~0 .cse8 1) (+ c_ULTIMATE.start_main_~main__index2~0 .cse9)) (<= c_ULTIMATE.start_main_~main__index2~0 (+ .cse8 99999)) (<= (* 4294967296 (div (+ (- c_ULTIMATE.start_main_~main__index1~0) (+ .cse1 4294967297)) 4294967296)) c_ULTIMATE.start_main_~main__index2~0) (<= (+ .cse9 1) c_ULTIMATE.start_main_~main__index1~0) (= |c_ULTIMATE.start_main_#t~mem3| (select .cse4 (+ |c_ULTIMATE.start_main_~#main__array~0.offset| (* 4 c_ULTIMATE.start_main_~main__index1~0) (* (- 17179869184) .cse10))))))))) is different from false [2018-11-06 22:50:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:56,013 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-06 22:50:56,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-06 22:50:56,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-06 22:50:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:56,014 INFO L225 Difference]: With dead ends: 40 [2018-11-06 22:50:56,014 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 22:50:56,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 58.9s TimeCoverageRelationStatistics Valid=145, Invalid=552, Unknown=9, NotChecked=50, Total=756 [2018-11-06 22:50:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 22:50:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 22:50:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 22:50:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 22:50:56,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-06 22:50:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:56,017 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 22:50:56,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 22:50:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 22:50:56,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 22:50:56,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 22:51:17,220 WARN L179 SmtUtils]: Spent 21.11 s on a formula simplification. DAG size of input: 112 DAG size of output: 45 Received shutdown request... [2018-11-06 22:52:57,511 WARN L187 SmtUtils]: Removed 7 from assertion stack [2018-11-06 22:52:57,511 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-11-06 22:52:57,513 INFO L168 Benchmark]: Toolchain (without parser) took 288785.84 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 866.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -884.4 MB). Peak memory consumption was 586.1 MB. Max. memory is 7.1 GB. [2018-11-06 22:52:57,518 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:52:57,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:52:57,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:52:57,521 INFO L168 Benchmark]: Boogie Preprocessor took 27.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:52:57,522 INFO L168 Benchmark]: RCFGBuilder took 694.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:52:57,524 INFO L168 Benchmark]: TraceAbstraction took 287636.65 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 115.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -114.5 MB). Peak memory consumption was 605.8 MB. Max. memory is 7.1 GB. [2018-11-06 22:52:57,536 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 371.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 694.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 287636.65 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 115.9 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -114.5 MB). Peak memory consumption was 605.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 135. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown