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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:48:09,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:48:09,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:48:09,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:48:09,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:48:09,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:48:09,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:48:09,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:48:09,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:48:09,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:48:09,168 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:48:09,168 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:48:09,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:48:09,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:48:09,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:48:09,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:48:09,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:48:09,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:48:09,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:48:09,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:48:09,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:48:09,180 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:48:09,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:48:09,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:48:09,183 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:48:09,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:48:09,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:48:09,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:48:09,192 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:48:09,193 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:48:09,193 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:48:09,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:48:09,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:48:09,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:48:09,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:48:09,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:48:09,199 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:09,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:48:09,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:48:09,226 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:48:09,226 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:48:09,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:48:09,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:48:09,227 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:48:09,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:48:09,228 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:48:09,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:48:09,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:48:09,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:48:09,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:48:09,229 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:48:09,229 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:48:09,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:48:09,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:48:09,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:48:09,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:48:09,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:48:09,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:48:09,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:48:09,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:48:09,231 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:48:09,231 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:48:09,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:48:09,231 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:48:09,231 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:48:09,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:48:09,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:48:09,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:48:09,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:48:09,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:48:09,299 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+nlh-reducer.c [2018-11-06 22:48:09,371 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86b15f760/8f0bfd6f8acc4ea3b9702c2c954bbe2a/FLAG4ba80da80 [2018-11-06 22:48:09,818 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:48:09,819 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-06 22:48:09,826 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86b15f760/8f0bfd6f8acc4ea3b9702c2c954bbe2a/FLAG4ba80da80 [2018-11-06 22:48:09,841 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86b15f760/8f0bfd6f8acc4ea3b9702c2c954bbe2a [2018-11-06 22:48:09,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:48:09,852 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:48:09,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:48:09,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:48:09,857 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:48:09,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710be24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:09, skipping insertion in model container [2018-11-06 22:48:09,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:09" (1/1) ... [2018-11-06 22:48:09,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:48:09,895 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:48:10,098 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:48:10,103 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:48:10,132 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:48:10,156 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:48:10,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:10 WrapperNode [2018-11-06 22:48:10,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:48:10,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:48:10,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:48:10,157 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:48:10,167 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:10" (1/1) ... [2018-11-06 22:48:10,177 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:10" (1/1) ... [2018-11-06 22:48:10,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:48:10,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:48:10,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:48:10,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:48:10,214 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:10" (1/1) ... [2018-11-06 22:48:10,214 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:10" (1/1) ... [2018-11-06 22:48:10,216 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:10" (1/1) ... [2018-11-06 22:48:10,216 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:10" (1/1) ... [2018-11-06 22:48:10,222 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:10" (1/1) ... [2018-11-06 22:48:10,225 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:10" (1/1) ... [2018-11-06 22:48:10,227 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:10" (1/1) ... [2018-11-06 22:48:10,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:48:10,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:48:10,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:48:10,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:48:10,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:10" (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:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-06 22:48:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:48:10,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:48:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-06 22:48:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-06 22:48:10,867 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:48:10,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:10 BoogieIcfgContainer [2018-11-06 22:48:10,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:48:10,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:48:10,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:48:10,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:48:10,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:48:09" (1/3) ... [2018-11-06 22:48:10,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219f90d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:10, skipping insertion in model container [2018-11-06 22:48:10,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:10" (2/3) ... [2018-11-06 22:48:10,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219f90d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:10, skipping insertion in model container [2018-11-06 22:48:10,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:10" (3/3) ... [2018-11-06 22:48:10,876 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-06 22:48:10,886 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:48:10,895 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-06 22:48:10,912 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-06 22:48:10,945 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:48:10,945 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:48:10,946 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:48:10,946 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:48:10,946 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:48:10,946 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:48:10,946 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:48:10,946 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:48:10,947 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:48:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-11-06 22:48:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-06 22:48:10,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:10,972 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:10,974 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:10,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:10,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1165652749, now seen corresponding path program 1 times [2018-11-06 22:48:10,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:10,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:11,180 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,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:11,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:48:11,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:48:11,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:48:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:48:11,200 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 4 states. [2018-11-06 22:48:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:11,469 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2018-11-06 22:48:11,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:48:11,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-06 22:48:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:11,482 INFO L225 Difference]: With dead ends: 88 [2018-11-06 22:48:11,482 INFO L226 Difference]: Without dead ends: 57 [2018-11-06 22:48:11,485 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:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-06 22:48:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2018-11-06 22:48:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-06 22:48:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-06 22:48:11,521 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 12 [2018-11-06 22:48:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:11,521 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-06 22:48:11,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:48:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-06 22:48:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-06 22:48:11,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:11,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:11,523 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:11,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:11,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1248441938, now seen corresponding path program 1 times [2018-11-06 22:48:11,523 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:11,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:11,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:11,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:11,595 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,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:11,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:48:11,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:48:11,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:48:11,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:48:11,598 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 3 states. [2018-11-06 22:48:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:11,748 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-06 22:48:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:48:11,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-06 22:48:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:11,752 INFO L225 Difference]: With dead ends: 78 [2018-11-06 22:48:11,752 INFO L226 Difference]: Without dead ends: 53 [2018-11-06 22:48:11,754 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,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-06 22:48:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2018-11-06 22:48:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-06 22:48:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-06 22:48:11,766 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 12 [2018-11-06 22:48:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:11,766 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-06 22:48:11,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:48:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-06 22:48:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-06 22:48:11,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:11,768 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:48:11,768 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:11,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1851758922, now seen corresponding path program 1 times [2018-11-06 22:48:11,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:11,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:11,837 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,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:11,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:48:11,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:48:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:48:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:48:11,840 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 3 states. [2018-11-06 22:48:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:11,956 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-06 22:48:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:48:11,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-06 22:48:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:11,958 INFO L225 Difference]: With dead ends: 72 [2018-11-06 22:48:11,958 INFO L226 Difference]: Without dead ends: 47 [2018-11-06 22:48:11,959 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,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-06 22:48:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2018-11-06 22:48:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-06 22:48:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-06 22:48:11,968 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2018-11-06 22:48:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:11,969 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-06 22:48:11,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:48:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-06 22:48:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-06 22:48:11,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:11,971 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,971 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:11,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:11,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2020134886, now seen corresponding path program 1 times [2018-11-06 22:48:11,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:11,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:11,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:11,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:12,033 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,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:12,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:48:12,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:48:12,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:48:12,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:48:12,035 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-11-06 22:48:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:12,048 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-06 22:48:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:48:12,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-06 22:48:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:12,052 INFO L225 Difference]: With dead ends: 43 [2018-11-06 22:48:12,052 INFO L226 Difference]: Without dead ends: 35 [2018-11-06 22:48:12,052 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:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-06 22:48:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-06 22:48:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-06 22:48:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-06 22:48:12,057 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2018-11-06 22:48:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:12,058 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-06 22:48:12,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:48:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-06 22:48:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-06 22:48:12,059 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:12,059 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:12,059 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:12,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:12,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1452918724, now seen corresponding path program 1 times [2018-11-06 22:48:12,060 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:12,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:12,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:12,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:12,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:12,348 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,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:12,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:48:12,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:48:12,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:48:12,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:48:12,350 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-11-06 22:48:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:12,553 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-06 22:48:12,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:48:12,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-06 22:48:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:12,556 INFO L225 Difference]: With dead ends: 66 [2018-11-06 22:48:12,557 INFO L226 Difference]: Without dead ends: 64 [2018-11-06 22:48:12,557 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:48:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-06 22:48:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 33. [2018-11-06 22:48:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-06 22:48:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-06 22:48:12,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2018-11-06 22:48:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:12,564 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-06 22:48:12,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:48:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-06 22:48:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-06 22:48:12,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:12,566 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:12,566 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:12,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1434001439, now seen corresponding path program 1 times [2018-11-06 22:48:12,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:12,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:12,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:12,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:12,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:12,726 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,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:12,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:48:12,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:48:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:48:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:48:12,728 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 6 states. [2018-11-06 22:48:13,077 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-06 22:48:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:13,303 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-11-06 22:48:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:48:13,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-06 22:48:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:13,306 INFO L225 Difference]: With dead ends: 105 [2018-11-06 22:48:13,306 INFO L226 Difference]: Without dead ends: 83 [2018-11-06 22:48:13,307 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:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-06 22:48:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 39. [2018-11-06 22:48:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-06 22:48:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-06 22:48:13,317 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2018-11-06 22:48:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:13,318 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-06 22:48:13,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:48:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-06 22:48:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-06 22:48:13,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:13,319 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:13,319 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:13,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:13,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2078417290, now seen corresponding path program 1 times [2018-11-06 22:48:13,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:13,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:13,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:13,599 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:13,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:13,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:48:13,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:48:13,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:48:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:48:13,601 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2018-11-06 22:48:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:48:13,769 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-06 22:48:13,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:48:13,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-06 22:48:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:48:13,774 INFO L225 Difference]: With dead ends: 75 [2018-11-06 22:48:13,774 INFO L226 Difference]: Without dead ends: 53 [2018-11-06 22:48:13,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:48:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-06 22:48:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2018-11-06 22:48:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-06 22:48:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-06 22:48:13,782 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2018-11-06 22:48:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:48:13,782 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-06 22:48:13,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:48:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-06 22:48:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-06 22:48:13,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:48:13,784 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:13,784 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:48:13,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:48:13,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1666906019, now seen corresponding path program 1 times [2018-11-06 22:48:13,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:48:13,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:48:13,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:13,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:48:13,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:48:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:48:14,398 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-11-06 22:48:14,599 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-06 22:48:14,957 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2018-11-06 22:48:15,080 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2018-11-06 22:48:15,331 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2018-11-06 22:48:22,064 WARN L179 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-11-06 22:48:28,743 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:28,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:48:28,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-06 22:48:28,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 22:48:28,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 22:48:28,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=189, Unknown=3, NotChecked=0, Total=240 [2018-11-06 22:48:28,745 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 16 states. [2018-11-06 22:48:36,318 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-11-06 22:48:58,422 WARN L179 SmtUtils]: Spent 15.14 s on a formula simplification. DAG size of input: 108 DAG size of output: 72 [2018-11-06 22:49:33,842 WARN L179 SmtUtils]: Spent 16.55 s on a formula simplification. DAG size of input: 101 DAG size of output: 69 [2018-11-06 22:50:03,698 WARN L179 SmtUtils]: Spent 26.93 s on a formula simplification. DAG size of input: 117 DAG size of output: 109 [2018-11-06 22:51:04,968 WARN L179 SmtUtils]: Spent 55.46 s on a formula simplification. DAG size of input: 131 DAG size of output: 99 [2018-11-06 22:51:19,362 WARN L179 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2018-11-06 22:51:25,282 WARN L179 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-06 22:51:29,620 WARN L179 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 75 [2018-11-06 22:51:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:51:36,688 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-11-06 22:51:36,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 22:51:36,688 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-11-06 22:51:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:51:36,689 INFO L225 Difference]: With dead ends: 63 [2018-11-06 22:51:36,689 INFO L226 Difference]: Without dead ends: 61 [2018-11-06 22:51:36,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 163.4s TimeCoverageRelationStatistics Valid=201, Invalid=841, Unknown=14, NotChecked=0, Total=1056 [2018-11-06 22:51:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-06 22:51:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2018-11-06 22:51:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-06 22:51:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-06 22:51:36,700 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 23 [2018-11-06 22:51:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:51:36,700 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-06 22:51:36,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 22:51:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-06 22:51:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-06 22:51:36,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:51:36,702 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:51:36,702 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:51:36,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:51:36,703 INFO L82 PathProgramCache]: Analyzing trace with hash 415600973, now seen corresponding path program 1 times [2018-11-06 22:51:36,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:51:36,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:51:36,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:51:36,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:51:36,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:51:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:51:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:51:37,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:51:37,302 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:51:37,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:51:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:51:37,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:51:38,311 WARN L854 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__index2~0 Int)) (let ((.cse0 (mod ULTIMATE.start_main_~main__index2~0 4294967296))) (and (< .cse0 100000) (< (mod c_ULTIMATE.start_main_~main__index1~0 4294967296) .cse0)))) is different from true [2018-11-06 22:51:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:51:38,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:51:38,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-06 22:51:38,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 22:51:38,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 22:51:38,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2018-11-06 22:51:38,407 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 11 states. [2018-11-06 22:51:40,912 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-11-06 22:51:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:51:41,107 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-11-06 22:51:41,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 22:51:41,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-06 22:51:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:51:41,109 INFO L225 Difference]: With dead ends: 95 [2018-11-06 22:51:41,109 INFO L226 Difference]: Without dead ends: 73 [2018-11-06 22:51:41,110 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=67, Invalid=146, Unknown=1, NotChecked=26, Total=240 [2018-11-06 22:51:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-06 22:51:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-11-06 22:51:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-06 22:51:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-06 22:51:41,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2018-11-06 22:51:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:51:41,120 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-06 22:51:41,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 22:51:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-06 22:51:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-06 22:51:41,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:51:41,122 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:51:41,122 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:51:41,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:51:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1979518665, now seen corresponding path program 1 times [2018-11-06 22:51:41,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:51:41,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:51:41,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:51:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:51:41,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:51:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:51:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:51:52,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:51:52,124 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:51:52,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:52:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-06 22:52:04,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-06 22:52:04,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-11-06 22:52:04,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 22:52:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 22:52:04,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=187, Unknown=3, NotChecked=0, Total=240 [2018-11-06 22:52:04,344 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 16 states. [2018-11-06 22:52:24,182 WARN L179 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2018-11-06 22:52:53,010 WARN L179 SmtUtils]: Spent 6.93 s on a formula simplification. DAG size of input: 85 DAG size of output: 54 Received shutdown request... [2018-11-06 22:52:59,879 WARN L187 SmtUtils]: Removed 8 from assertion stack [2018-11-06 22:52:59,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-06 22:52:59,880 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 22:52:59,884 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 22:52:59,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:52:59 BoogieIcfgContainer [2018-11-06 22:52:59,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:52:59,885 INFO L168 Benchmark]: Toolchain (without parser) took 290033.60 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:52:59,886 INFO L168 Benchmark]: CDTParser took 0.23 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:59,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.90 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:59,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.34 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:59,888 INFO L168 Benchmark]: Boogie Preprocessor took 26.58 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:59,888 INFO L168 Benchmark]: RCFGBuilder took 638.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-06 22:52:59,889 INFO L168 Benchmark]: TraceAbstraction took 289014.81 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 118.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -48.3 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:52:59,894 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.23 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 303.90 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 45.34 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 26.58 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 638.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 289014.81 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 118.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -48.3 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 68). Cancelled while BasicCegarLoop was constructing difference of abstraction (44states) and FLOYD_HOARE automaton (currently 20 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (44states) and FLOYD_HOARE automaton (currently 20 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 105). Cancelled while BasicCegarLoop was constructing difference of abstraction (44states) and FLOYD_HOARE automaton (currently 20 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 3 error locations. TIMEOUT Result, 288.9s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 247.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 323 SDtfs, 558 SDslu, 622 SDs, 0 SdLazy, 737 SolverSat, 52 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 54.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 212.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 187 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 12.4s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 219 ConstructedInterpolants, 8 QuantifiedInterpolants, 83569 SizeOfPredicates, 3 NumberOfNonLiveVariables, 100 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 18/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown